Initial commit

31 files changed, 2836 insertions, 0 deletions

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..123c3f4
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,5 @@
+*.out
+*.o
+*.img
+*.map
+bx_enh_dbg.ini
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. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+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:
+
+    <program>  Copyright (C) <year>  <name of author>
+    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
+<https://www.gnu.org/licenses/>.
+
+  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
+<https://www.gnu.org/licenses/why-not-lgpl.html>.
diff --git a/Makefile b/Makefile
new file mode 100644
index 0000000..cf58fa7
--- /dev/null
+++ b/Makefile
@@ -0,0 +1,57 @@
+SHELL:=/bin/bash
+
+CFLAGS:= \
+	-nostdlib \
+	-nostdinc \
+	-fno-builtin \
+	-fno-stack-protector \
+	-nostartfiles \
+	-nodefaultlibs \
+	-Wall \
+	-Wextra \
+	-Werror
+
+STAGE3 = \
+	stage3/main.o \
+	stage3/gfx.o \
+	stage3/halt.o \
+	stage3/framebuffer.o \
+	stage3/memory.o \
+	stage3/paging.o
+
+lizzyx.img: stage1.out stage2.out stage3.out
+	cat stage{1,2,3}.out > lizzyx.img
+
+stage1.out: stage1/main.asm stage1/print.asm stage2.out stage3.out
+	nasm -f bin stage1/main.asm -o stage1.out \
+		-dKSIZE=$$(du -cb stage{2,3}.out | tail -n1 | cut -f1)
+
+stage2.out: stage2/main.asm stage2/mmap.asm stage2/paging.asm stage2/vesa.asm stage1/print.asm
+	nasm -f bin stage2/main.asm -o stage2.out
+	dd if=/dev/zero bs=1 count=$$(echo 4608-$$(du -b stage2.out | cut -f1) | bc) >> stage2.out
+
+stage3.out: $(STAGE3) stage3.ld
+	ld $(STAGE3) -T stage3.ld -Map=stage3.map
+
+stage3/%.o: stage3/%.asm
+	nasm -f elf64 $< -o $@
+
+stage3/%.o: stage3/%.c
+	cc $(CFLAGS) -c $< -o $@
+
+.PHONY: run clean flash disas map
+
+run: lizzyx.img
+	echo c | bochs -q
+
+clean:
+	rm -rf stage3/*.o *.out *.img *.map
+
+flash: lizzyx.img
+	dd if=lizzyx.img of=$(DEV)
+
+disas: stage3.out
+	objdump -b binary -D -M intel -m i386:x86-64 stage3.out --adjust-vma 0x9000
+
+map: stage3.out
+	cat stage3.map
diff --git a/bochsrc b/bochsrc
new file mode 100644
index 0000000..842f2a0
--- /dev/null
+++ b/bochsrc
@@ -0,0 +1,3 @@
+floppya: 1_44=lizzyx.img, status=inserted
+boot: a
+display_library: x, options="gui_debug"
diff --git a/stage1/main.asm b/stage1/main.asm
new file mode 100644
index 0000000..97ff7c7
--- /dev/null
+++ b/stage1/main.asm
@@ -0,0 +1,60 @@
+[org 0x7C00]
+
+%define KSTART 0x7E00
+%define KSECTORS (KSIZE + 511) / 512
+
+boot:
+	; init segment registers
+	xor ax, ax
+	mov ds, ax
+	mov es, ax
+	mov fs, ax
+	mov gs, ax
+	mov ss, ax
+
+	; init stack
+	mov bp, KSTART ; stack grows down, overwriting MBR
+	mov sp, bp
+
+	; print message
+	mov ebx, .msg
+	call print_str
+
+	; load stage2 and stage3
+	call load_stages
+
+	; jump into stage2
+	jmp KSTART
+
+.msg: db 10, 13, "nyax stage1", 10, 13, 0
+
+
+load_stages:
+	mov ebx, .msg
+	call print_str
+
+	mov ah, 0x02     ; read sectors from drive
+	mov al, KSECTORS ; number of sectors
+	xor ch, ch       ; cylinder=0
+	mov cl, 2        ; sector=2
+	xor dh, dh       ; head=0
+	mov bx, KSTART   ; buffer
+	int 0x13
+	jc .fail         ; CF set on error
+	cmp al, KSECTORS ; check read sectors count
+	jne .fail
+
+	ret
+
+.fail:
+	mov ebx, .fail_msg
+	call print_str
+	hlt
+
+.msg: db "loading stage2 and stage3 from disk", 10, 13, 0
+.fail_msg: db "disk failure, try rebooting", 10, 13, 0
+
+%include "stage1/print.asm"
+
+times 510-($-$$) db 0
+dw 0xAA55
diff --git a/stage1/print.asm b/stage1/print.asm
new file mode 100644
index 0000000..3505eb6
--- /dev/null
+++ b/stage1/print.asm
@@ -0,0 +1,12 @@
+; uses eax, ebx
+print_str:
+	mov ah, 0x0E
+.print:
+	mov al, [ebx]
+	cmp al, 0
+	je .return
+	int 0x10
+	inc ebx
+	jmp .print
+.return:
+	ret
diff --git a/stage2/main.asm b/stage2/main.asm
new file mode 100644
index 0000000..50fee42
--- /dev/null
+++ b/stage2/main.asm
@@ -0,0 +1,94 @@
+[org 0x7E00]
+
+%define PAGETABLE 0x1000
+%define VESAINFO  0x0500
+%define VESAMODE VESAINFO+512
+%define OWNMODE  VESAMODE+256
+%define GFXINFO PAGETABLE-10
+;%define MEMMAPCNT GFXINFO-2
+%define MEMMAP 0x500
+
+setup:
+	; print message
+	mov ebx, .msg
+	call print_str
+
+	; setup VESA
+	call vesa
+
+	; get extended memory map
+	call mmap
+
+	; build page table
+	call paging
+
+	; jump into long mode
+	jmp 0x0008:long_mode
+
+.msg:
+	db 10, 13, "nyax stage2", 10, 13, 0
+
+%include "stage2/vesa.asm"
+%include "stage2/mmap.asm"
+%include "stage2/paging.asm"
+%include "stage1/print.asm"
+
+; modify eax, ebx, ecx, edx
+print_hex:
+	mov ebx, 0x10
+	jmp print_num
+print_dec:
+	mov ebx, 10
+print_num:
+	xor ecx, ecx
+.convert:
+	inc ecx
+	xor edx, edx
+	div ebx
+	cmp dl, 10
+	jb .digit
+	add dl, 'A'-10
+	jmp .next
+.digit:
+	add dl, '0'
+.next:
+	push dx
+	cmp eax, 0
+	jne .convert
+.print:
+	cmp ecx, 0
+	je .return
+	dec ecx
+	pop ax
+	mov ah, 0x0E
+	int 0x10
+	jmp .print
+.return:
+	ret
+
+newline:
+	mov al, 10
+	call print_chr
+
+	mov al, 13
+	call print_chr
+
+	ret
+
+print_chr:
+	mov ah, 0x0E
+	int 0x10
+	ret
+
+[bits 64]
+
+long_mode:
+	; setup segment registers
+	mov ax, 0x0010
+	mov ds, ax
+	mov es, ax
+	mov fs, ax
+	mov gs, ax
+	mov ss, ax
+
+	; kernel begins here
diff --git a/stage2/mmap.asm b/stage2/mmap.asm
new file mode 100644
index 0000000..b5cbe79
--- /dev/null
+++ b/stage2/mmap.asm
@@ -0,0 +1,56 @@
+%define MAPMAGIC 0x534D4150
+
+mmap:
+	mov ebx, .msg
+	call print_str
+
+	xor ebx, ebx    ; counter for interrupt
+	mov di, MEMMAP
+
+.loop:
+	; issue an INT 0x15, EAX = 0xE820 interrupt
+	mov eax, 0xE820
+	mov ecx, 24
+	mov edx, MAPMAGIC
+	int 0x15
+
+	cmp eax, MAPMAGIC ; detect failure
+	jne .fail
+
+	cmp dword[di+16], 1
+	jne .next
+
+	cmp dword[di+4], 0
+	jne .keep
+
+	cmp dword[di+0], 0x100000
+	jb .next
+
+.keep:
+	mov dword[di+20], 0
+	add di, 24
+
+.next:
+	cmp ebx, 0
+	jne .loop
+
+	mov dword[di+0], 0
+	mov dword[di+4], 0
+
+	;mov ax, di
+	;sub ax, MEMMAP
+	;xor dx, dx
+	;mov bx, 24
+	;div bx
+	;mov [MEMMAPCNT], ax
+
+	ret
+
+.fail:
+	mov ebx, .fail_msg
+	call print_str
+	jmp $
+
+.msg: db "getting extended memory map", 10, 13, 0
+.fail_msg: db "memory map failure", 10, 13, 0
+
diff --git a/stage2/paging.asm b/stage2/paging.asm
new file mode 100644
index 0000000..91ed0ac
--- /dev/null
+++ b/stage2/paging.asm
@@ -0,0 +1,77 @@
+paging:
+	; print message
+	mov ebx, .msg
+	call print_str
+
+	; clear 4 levels of page maps
+	mov di, PAGETABLE+0x0000
+.clr_buf:
+	mov byte[di], 0
+	inc di
+	cmp di, PAGETABLE+0x4000
+	jne .clr_buf
+
+	; init 3 page map levels
+	mov dword[PAGETABLE+0x0000], PAGETABLE+0x1003
+	mov dword[PAGETABLE+0x1000], PAGETABLE+0x2003
+	mov dword[PAGETABLE+0x2000], PAGETABLE+0x3003
+
+	; fill up level 4 page map
+	mov eax, 3
+	mov di, PAGETABLE+0x3000
+.build_pt:
+	mov [di], eax
+	add di, 8
+	add eax, 0x1000
+	cmp eax, 0x100000
+	jb .build_pt
+
+	; enable paging and long mode
+
+	mov di, PAGETABLE
+
+	mov al, 0xFF
+	out 0xA1, al
+	out 0x21, al
+
+	nop
+	nop
+
+	lidt [.idt]
+
+	mov eax, 0b10100000
+	mov cr4, eax
+
+	mov edx, edi
+	mov cr3, edx
+
+	mov ecx, 0xC0000080
+	rdmsr
+
+	or eax, 0x00000100
+	wrmsr
+
+	mov ebx, cr0
+	or ebx, 0x80000001
+	mov cr0, ebx
+
+	lgdt [.gdt_pointer]
+
+	ret
+
+.gdt:
+	dq 0
+	dq 0x00209A0000000000
+	dq 0x0000920000000000
+	dw 0
+
+.gdt_pointer:
+	dw $ - .gdt - 1
+	dd .gdt
+
+.idt:
+	dw 0
+	dd 0
+
+.msg:
+	db "building page table", 10, 13, 0
diff --git a/stage2/vesa.asm b/stage2/vesa.asm
new file mode 100644
index 0000000..da7eb81
--- /dev/null
+++ b/stage2/vesa.asm
@@ -0,0 +1,190 @@
+vesa:
+	; print message
+	mov ebx, .msg
+	call print_str
+
+	; get vesa bios info
+	mov eax, dword[.vbe2]
+	mov dword[VESAINFO], eax ; move "VBE2" to start of vesainfo struct
+	mov ax, 0x4F00           ; get VESA BIOS information
+	mov di, VESAINFO         ; struct buffer
+	int 0x10
+
+	cmp ax, 0x004F           ; check ax for correct magic number
+	jne .fail_getinfo
+
+	mov eax, dword[.vesa]
+	cmp dword[VESAINFO], eax ; check if "VESA" is at start of stuct
+	jne .fail_getinfo
+
+	; print select message
+	mov ebx, .select_msg
+	call print_str
+
+	; get segment:offset pointer to video modes into gs:ebx
+	movzx ebx, word[VESAINFO+14]
+	mov    ax, word[VESAINFO+16]
+	mov gs, ax
+
+	; convert modes to own structure
+
+	xor esi, esi        ; number of avail modes
+
+.mode_loop:
+	; get mode info
+	mov cx, [gs:ebx]    ; video mode into cx
+	cmp cx, 0xFFFF      ; 0xFFFF is terminator, no suitable mode has been found
+	je .mode_done
+	mov ax, 0x4F01      ; get VESA mode information
+	mov di, VESAMODE    ; vesa mode info struct buffer
+	int 0x10
+
+	cmp ax, 0x004F      ; check ax for correct magic number
+	jne .fail_modeinfo
+
+	mov al, byte[VESAMODE] ; get attributes
+	and al, 0b10000000     ; extract bit 7, indicates linear framebuffer support
+	jz .mode_next
+
+	mov al, byte[VESAMODE+25] ; get bpp (bits per pixel)
+	cmp al, 32
+	jne .mode_next
+
+	push ebx ; print_dec and print_str modify ebx
+
+	mov eax, esi
+	mov ebx, 12
+	mul ebx
+	mov edi, eax
+	add edi, OWNMODE
+
+	mov [edi+10], cx ; copy mode
+
+	; print selector
+	mov al, '['
+	call print_chr
+
+	mov eax, esi
+	add eax, 'a'
+	call print_chr
+
+	mov al, ']'
+	call print_chr
+
+	mov al, ' '
+	call print_chr
+
+	mov ax, [VESAMODE+16] ; copy pitch
+	mov [edi+0], ax
+
+	movzx eax, word[VESAMODE+18] ; copy width
+	mov [edi+2], ax
+	call print_dec
+
+	mov al, 'x'
+	call print_chr
+
+	movzx eax, word[VESAMODE+20] ; copy height
+	mov [edi+4], ax
+	call print_dec
+	call newline
+
+	mov eax, [VESAMODE+40] ; copy framebuffer
+	mov [edi+6], eax
+
+	pop ebx
+
+	inc esi
+	cmp esi, 'z'-'a'   ; only print up to z
+	jg .mode_done
+
+.mode_next:
+	add ebx, 2         ; increase mode pointer
+	jmp .mode_loop     ; loop
+
+.mode_done:
+	cmp esi, 0
+	je .fail_nomode
+
+.input:
+	mov ebx, .select_prompt
+	call print_str
+
+	mov ah, 0x00   ; get keypress, blocking
+	int 0x16
+
+	call print_chr ; echo user input
+
+	movzx edi, al  ; backup al
+	call newline
+
+	sub edi, 'a'
+	cmp edi, esi
+	jb .valid      ; check validity
+
+	mov ebx, .invalid
+	call print_str
+
+	jmp .input
+
+.valid:
+	; convert selected number to address
+	mov eax, edi
+	mov ebx, 12
+	mul ebx
+	add eax, OWNMODE
+
+	; copy to final gfx info location
+	mov ebx, [eax+0]
+	mov [GFXINFO+0], ebx
+
+	mov ebx, [eax+4]
+	mov [GFXINFO+4], ebx
+
+	mov bx, [eax+8]
+	mov [GFXINFO+8], bx
+
+	;mov edi, eax
+	;mov eax, [edi+6]
+	;call print_hex
+	;call newline
+	;mov eax, edi
+	;jmp $
+
+	;ret
+
+	; set mode
+	mov bx, [eax+10]           ; video mode in bx (first 13 bits)
+	or  bx, 1 << 14            ; set bit 14: enable linear frame buffer
+	and bx, 0b0111111111111111 ; clear deprecated bit 15
+	mov ax, 0x4F02             ; set VBE mode
+	int 0x10
+
+	ret
+
+.msg: db "setting up vesa", 10, 13, 0
+.vbe2: db "VBE2"
+.vesa: db "VESA"
+.select_msg: db "avaliable video modes:", 10, 13, 0
+.select_prompt: db "select video mode: ", 0
+.invalid: db "invalid input", 10, 13, 0
+
+.fail_getinfo:
+	mov ebx, .fail_getinfo_msg
+	jmp .fail
+
+.fail_modeinfo:
+	mov ebx, .fail_modeinfo_msg
+	jmp .fail
+
+.fail_nomode:
+	mov ebx, .fail_nomode_msg
+	jmp .fail
+
+.fail_getinfo_msg: db "failed getting vesa bios info", 10, 13, 0
+.fail_modeinfo_msg: db "failed getting video mode info", 10, 13, 0
+.fail_nomode_msg: db "no suitable video modes available", 10, 13, 0
+
+.fail:
+	call print_str
+	jmp $
diff --git a/stage3.ld b/stage3.ld
new file mode 100644
index 0000000..da72329
--- /dev/null
+++ b/stage3.ld
@@ -0,0 +1,10 @@
+OUTPUT(stage3.out)
+OUTPUT_FORMAT(binary)
+ENTRY(kmain)
+
+SECTIONS
+{
+	. = 0x9000;
+	.text : { *(.text) }
+	.data : { *(.bss .data .rodata) }
+}
diff --git a/stage3/colors.asm b/stage3/colors.asm
new file mode 100644
index 0000000..a53efff
--- /dev/null
+++ b/stage3/colors.asm
@@ -0,0 +1,16 @@
+%define COLOR_BLACK 0
+%define COLOR_BLUE 1
+%define COLOR_GREEN 2
+%define COLOR_CYAN 3
+%define COLOR_RED 4
+%define COLOR_MAGENTA 5
+%define COLOR_BROWN 6
+%define COLOR_LIGHT_GREY 7
+%define COLOR_DARK_GREY 8
+%define COLOR_LIGHT_BLUE 9
+%define COLOR_LIGHT_GREEN 10
+%define COLOR_LIGHT_CYAN 11
+%define COLOR_LIGHT_RED 12
+%define COLOR_LIGHT_MAGENTA 13
+%define COLOR_LIGHT_BROWN 14
+%define COLOR_WHITE 15
diff --git a/stage3/def.h b/stage3/def.h
new file mode 100644
index 0000000..c2f8311
--- /dev/null
+++ b/stage3/def.h
@@ -0,0 +1,21 @@
+#ifndef _DEF_H_
+#define _DEF_H_
+
+#define nil ((void *) 0x0)
+
+typedef unsigned char u8;
+typedef signed char i8;
+
+typedef unsigned short u16;
+typedef short i16;
+
+typedef unsigned int u32;
+typedef int i32;
+
+typedef unsigned long u64;
+typedef long i64;
+
+typedef u64 usize;
+typedef i64 isize;
+
+#endif
diff --git a/stage3/font.asm b/stage3/font.asm
new file mode 100644
index 0000000..b73edab
--- /dev/null
+++ b/stage3/font.asm
@@ -0,0 +1,243 @@
+global debug
+
+%define GFXINFO 0x1000-10
+%define PITCH GFXINFO+0
+%define WIDTH GFXINFO+2
+%define HEIGHT GFXINFO+4
+%define FRAMEBUFFER GFXINFO+6
+
+section .text
+
+; str in rdi
+debug:
+	mov r9, [line]
+
+	mov rax, rcx
+	mov rbx, 15
+	xor rdx, rdx
+	mul rbx
+
+	cmp rax, [HEIGHT]
+	jmp .char
+
+	xor rax, rax
+	xor r9, r9
+
+.char:
+	xor rax, rax
+
+	mov al, [rdi]
+	cmp al, 0
+	je .return
+
+	cmp al, ' '
+	je .space
+
+	cmp al, 'a'
+	jb .invalid
+
+	cmp al, 'z'
+	ja .invalid
+
+	sub al, 'a'
+	mov bl, 15
+	mul bl
+
+	add rax, letters
+	mov r8, rax
+
+	jmp .render
+
+.space:
+	mov r8, letters.space
+
+.render:
+
+.target:
+	xor rdx, rdx
+	mul [PITCH]
+
+	xor rbx, rbx
+	mov ebx, [FRAMEBUFFER]
+	add rax, rbx
+
+	inc rdi
+	jmp debug
+
+.return:
+	ret
+
+.invalid:
+	mov rdi, .invalid_msg
+	call debug
+	jmp $
+
+.invalid_msg: "invalid character in message", 0
+
+section .data
+
+line: dq 0
+
+letters:
+.a: db
+1, 1, 1,
+1, 0, 1,
+1, 1, 1,
+1, 0, 1,
+1, 0, 1
+.b: db
+1, 1, 0,
+1, 0, 1,
+1, 1, 1,
+1, 0, 1,
+1, 1, 1
+.c: db
+1, 1, 1,
+1, 0, 0,
+1, 0, 0,
+1, 0, 0,
+1, 1, 1
+.d: db
+1, 1, 0,
+1, 0, 1,
+1, 0, 1,
+1, 0, 1,
+1, 1, 1
+e: db
+1, 1, 1,
+1, 0, 0,
+1, 1, 1,
+1, 0, 0,
+1, 1, 1
+f: db
+1, 1, 1,
+1, 0, 0,
+1, 1, 1,
+1, 0, 0,
+1, 0, 0
+g: db
+1, 1, 1,
+1, 0, 0,
+1, 0, 1,
+1, 0, 1,
+1, 1, 1
+h: db
+1, 0, 1,
+1, 0, 1,
+1, 1, 1,
+1, 0, 1,
+1, 0, 1
+i: db
+0, 1, 0,
+0, 1, 0,
+0, 1, 0,
+0, 1, 0,
+0, 1, 0
+j: db
+0, 0, 1,
+0, 0, 1,
+0, 0, 1,
+0, 0, 1,
+1, 1, 1
+k: db
+1, 0, 1,
+1, 1, 0,
+1, 0, 0,
+1, 1, 0,
+1, 0, 1,
+l: db
+1, 0, 0,
+1, 0, 0,
+1, 0, 0,
+1, 0, 0,
+1, 1, 1
+m: db
+1, 0, 1,
+1, 1, 1,
+1, 0, 1,
+1, 0, 1,
+1, 0, 1
+n: db
+1, 0, 1,
+1, 0, 1,
+1, 1, 1,
+1, 1, 1,
+1, 0, 1
+o: db
+1, 1, 1,
+1, 0, 1,
+1, 0, 1,
+1, 0, 1,
+1, 1, 1
+p: db
+1, 1, 1,
+1, 0, 1,
+1, 1, 1,
+1, 0, 0,
+1, 0, 0
+q: db
+1, 1, 1,
+1, 0, 1,
+1, 1, 1,
+1, 1, 1,
+0, 0, 1
+r: db
+1, 1, 1,
+1, 0, 1,
+1, 1, 1,
+1, 1, 0,
+1, 0, 1
+s: db
+1, 1, 1,
+1, 0, 0,
+1, 1, 1,
+0, 0, 1,
+1, 1, 1
+t: db
+1, 1, 1,
+0, 1, 0,
+0, 1, 0,
+0, 1, 0,
+0, 1, 0
+u: db
+1, 0, 1,
+1, 0, 1,
+1, 0, 1,
+1, 0, 1,
+1, 1, 1
+v: db
+1, 0, 1,
+1, 0, 1,
+1, 0, 1,
+1, 0, 1,
+0, 1, 0
+w: db
+1, 0, 1,
+1, 0, 1,
+1, 0, 1,
+1, 1, 1,
+1, 0, 1
+x: db
+1, 0, 1,
+1, 0, 1,
+0, 1, 0,
+1, 0, 1,
+1, 0, 1
+y: db
+1, 0, 1,
+1, 0, 1,
+1, 1, 1,
+0, 1, 0,
+0, 1, 0
+z: db
+1, 1, 1,
+0, 0, 1,
+0, 1, 0
+1, 0, 0
+1, 1, 1
+.space:
+0, 0, 0,
+0, 0, 0,
+0, 0, 0,
+0, 0, 0,
+0, 0, 0
diff --git a/stage3/framebuffer.asm b/stage3/framebuffer.asm
new file mode 100644
index 0000000..e55ad04
--- /dev/null
+++ b/stage3/framebuffer.asm
@@ -0,0 +1,176 @@
+%include "stage3/colors.asm"
+global print_chr, print_str, print_dec, print_hex, clear_screen, newline
+extern memcpy
+
+section .data
+
+pos:
+.row: db 0
+.col: db 0
+
+cursor: dq 0xB8000
+color: db COLOR_WHITE | (COLOR_BLACK << 4)
+
+section .text
+
+set_color:
+	shl sil, 4
+	add dil, sil
+	mov [color], dil
+
+update_cursor:
+	mov rbx, [cursor]
+	sub rbx, 0xB8000
+	shr rbx, 1
+
+	mov dx, 0x3D4
+	mov al, 14
+	out dx, al
+
+	mov dx, 0x3D5
+	mov al, bh
+	out dx, al
+
+	mov dx, 0x3D4
+	mov al, 15
+	out dx, al
+
+	mov dx, 0x3D5
+	mov al, bl
+	out dx, al
+
+	ret
+
+set_chr:
+	mov rax, [cursor]
+	mov byte[rax], dil
+	inc rax
+	mov dil, [color]
+	mov [rax], dil
+	inc rax
+	mov [cursor], rax
+	jmp update_cursor
+
+vertical_tab:
+	mov al, [pos.row]
+	inc al
+	cmp al, 25
+	je .scroll
+	mov [pos.row], al
+	mov rax, [cursor]
+	add rax, 160
+	mov [cursor], rax
+	jmp update_cursor
+.scroll:
+	mov rdi, 0xB8000
+	mov rsi, 0xB80A0
+	mov rdx, 0xF00
+	jmp memcpy
+
+carriage_return:
+	mov rax, [cursor]
+	xor rbx, rbx
+	mov bl, [pos.col]
+	shl bl, 1
+	sub rax, rbx
+	mov [cursor], rax
+	mov byte[pos.col], 0
+	jmp update_cursor
+
+newline:
+	call vertical_tab
+	jmp carriage_return
+
+print_chr:
+	cmp dil, 10
+	je newline
+	cmp dil, 11
+	je vertical_tab
+	cmp dil, 13
+	je carriage_return
+	mov al, [pos.col]
+	inc al
+	cmp al, 80
+	je .newline
+	mov [pos.col], al
+	jmp set_chr
+.newline:
+	push rdi
+	call newline
+	pop rdi
+	jmp set_chr
+
+print_str:
+	mov rax, rdi
+.print:
+	mov dil, [rax]
+	cmp dil, 0
+	je .return
+	push rax
+	call print_chr
+	pop rax
+	inc rax
+	jmp .print
+.return:
+	ret
+
+print_hex:
+	mov rsi, 0x10
+	jmp print_num
+print_dec:
+	mov rsi, 10
+print_num:
+	mov rax, rdi
+	xor rcx, rcx
+.convert:
+	inc rcx
+	xor rdx, rdx
+	div rsi
+	cmp dl, 10
+	jb .digit
+	add dl, 'A'-10
+	jmp .next
+.digit:
+	add dl, '0'
+.next:
+	push rdx
+	cmp rax, 0
+	jne .convert
+.print:
+	cmp rcx, 0
+	je .return
+	dec rcx
+	pop rdi
+	push rcx
+	call print_chr
+	pop rcx
+	jmp .print
+.return:
+	ret
+
+clear_screen:
+	push rbx
+	push r12
+	push r13
+	push r14
+	push r15
+
+	mov qword[cursor], 0xB8000
+.clr:
+	cmp qword[cursor], 0xB8FA0
+	je .return
+	mov dil, ' '
+	call set_chr
+	jmp .clr
+.return:
+	mov qword[cursor], 0xB8000
+	mov byte[pos.row], 0
+	mov byte[pos.col], 0
+	call update_cursor
+
+	pop r15
+	pop r14
+	pop r13
+	pop r12
+	pop rbx
+	ret
diff --git a/stage3/fut/linkgen.lua b/stage3/fut/linkgen.lua
new file mode 100755
index 0000000..f7a6d21
--- /dev/null
+++ b/stage3/fut/linkgen.lua
@@ -0,0 +1,101 @@
+#!/usr/bin/env lua
+--[[
+
+--- trigger warning: brain damage ---
+
+BOGUS DYNAMIC LINKING v69.420 by LIZZY FLECKENSTEIN
+
+How this works:
+⠀⠀⠀⠀⠀⢰⡿⠋⠁⠀⠀⠈⠉⠙⠻⣷⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
+⠀⠀⠀⠀⢀⣿⠇⠀⢀⣴⣶⡾⠿⠿⠿⢿⣿⣦⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
+⠀⠀⣀⣀⣸⡿⠀⠀⢸⣿⣇⠀⠀⠀⠀⠀⠀⠙⣷⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
+⠀⣾⡟⠛⣿⡇⠀⠀⢸⣿⣿⣷⣤⣤⣤⣤⣶⣶⣿⠇⠀⠀⠀⠀⠀⠀⠀⣀⠀⠀
+⢀⣿⠀⢀⣿⡇⠀⠀⠀⠻⢿⣿⣿⣿⣿⣿⠿⣿⡏⠀⠀⠀⠀⢴⣶⣶⣿⣿⣿⣆
+⢸⣿⠀⢸⣿⡇⠀⠀⠀⠀⠀⠈⠉⠁⠀⠀⠀⣿⡇⣀⣠⣴⣾⣮⣝⠿⠿⠿⣻⡟
+⢸⣿⠀⠘⣿⡇⠀⠀⠀⠀⠀⠀⠀⣠⣶⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠁⠉⠀
+⠸⣿⠀⠀⣿⡇⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠟⠉⠀⠀⠀⠀
+⠀⠻⣷⣶⣿⣇⠀⠀⠀⢠⣼⣿⣿⣿⣿⣿⣿⣿⣛⣛⣻⠉⠁⠀⠀⠀⠀⠀⠀⠀
+⠀⠀⠀⠀⢸⣿⠀⠀⠀⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀
+⠀⠀⠀⠀⢸⣿⣀⣀⣀⣼⡿⢿⣿⣿⣿⣿⣿⡿⣿⣿⡿
+
+Amogus sus 😳 ((impassta))
+
+I FUCKING HATE TEH ANTICRIST!!!!
+WE GOT YOU SURROUNDEND, USE DYNAMIC LINKING
+
+:trollface:
+
+]]
+
+-- in
+local hdr_kern = io.open("sys_kern.h", "r")
+-- out
+local hdr_user = io.open("sys_user.h", "w")
+local src_kern = io.open("sys_kern.c", "w")
+local src_user = io.open("sys_user.c", "w")
+
+local count = 0
+local calltable = "0x500"
+
+local body_kern = ""
+local body_user = ""
+
+src_kern:write("#include <sys_kern.h>\n")
+src_user:write("#include <sys_user.h>\n\n")
+
+local function process_line(line)
+	if line == "" or line:sub(1, 1) == "\t" then
+		return
+	end
+
+	local f, t = line:find("[%w_]+%(")
+
+	if not f then
+		return
+	end
+
+	local start, mid, fin = line:sub(1, f-1), line:sub(f, t-1), line:sub(t)
+
+	if mid == "__attribute__" or mid == "link" then
+		return
+	end
+
+	local decl = start .. "(*" .. mid .. ")" .. fin .. "\n"
+
+	hdr_user:write("extern " .. decl)
+	src_user:write(decl)
+
+	body_kern = body_kern .. "\tcalltable[" .. count .. "] = &" .. mid .. ";\n"
+	body_user = body_user .. "\t" .. mid .. " = calltable[" .. count .. "];\n"
+
+	count = count + 1
+
+	return true
+end
+
+while true do
+	local line = hdr_kern:read()
+
+	if not line then
+		break
+	end
+
+	if not process_line(line) then
+		hdr_user:write(line .. "\n")
+	end
+end
+
+local function write_link(f, content)
+	f:write("\nvoid link()\n{\n")
+	f:write("\tvoid **calltable = " .. calltable .. ";\n\n")
+	f:write(content)
+	f:write("}\n")
+end
+
+write_link(src_kern, body_kern)
+write_link(src_user, body_user)
+
+hdr_kern:close()
+hdr_user:close()
+src_kern:close()
+src_user:close()
diff --git a/stage3/fut/os b/stage3/fut/os
new file mode 100644
index 0000000..64d627f
--- /dev/null
+++ b/stage3/fut/os
@@ -0,0 +1,161 @@
+gfx
+	- modes text, pixel
+	- different buffers
+	- switch between them manually or thingily
+
+- similar to tmux
+- hierarchy
+
+- text input channel
+- keyboard input channel
+- mouse input channel
+
+- text output channel
+	-
+- graphics output channel
+
+- add text?
+- scrollback?
+
+init
+
+copy
+remove
+move
+list
+edit
+directory
+
+shell
+terminal
+
+mouse
+keyboard
+text
+
+tiler
+desktop
+
+--
+
+process, display, channel
+
+--
+
+display.x
+display.y
+display.width
+display.height
+display.index
+display.parent
+
+display = current_display()
+display = create_display(x, y, width, height)
+
+add_display(parent, child, -1)
+remove_display(parent, child)
+
+display.set_char(pos, color, text)
+display.set_pixel(pos, color)
+display.flush()
+
+channel = create_channel()
+add_channel(display, channel, name)
+channel = get_channel(display, name)
+
+--
+
+process = create_process(path, display)
+
+add_channel(process, channel)
+get_channel(process, "signal")
+get_channel(process, "status")
+
+--
+
+current_process()
+	.get_channel("status")
+	.send(finish)
+
+--
+void main()
+{
+	current_display()
+		.get_channel("text")
+		.send("hello, world\n");
+}
+
+--
+
+append(string self, string other)
+{
+	self.grow(other.len())
+	memcpy(self.ptr + self.len() - other.len(), other.ptr, other.len())
+}
+
+--
+string get_line(channel input)
+{
+	string s = "";
+
+	loop {
+		string c = input.recv();
+
+		if (c[0] == '\n')
+			break;
+
+		s.append(c);
+	}
+
+	return s;
+}
+
+--
+void main()
+{
+	channel input = current_display()
+		.get_channel("keyboard");
+
+	loop {
+		string command = get_line(input);
+
+		process proc = create_process(path, current_display());
+
+		receiver status = proc
+			.get_channel("status")
+			.subscribe();
+
+		proc.start();
+
+		while (!status.recv().equal("finish"))
+			yield();
+	}
+}
+
+--
+void main()
+{
+
+}
+
+-- channels
+void send(channel c, value v)
+{
+	listener l = c.listeners.pop();
+
+	if (l) {
+		listener.resume(v)
+	} else {
+		for (s in c.subscribers) {
+			if (s.active)
+				s.active.resume(v)
+			else
+				s.buffer.append(v)
+		}
+	}
+}
+
+-- queue
+
+- runqueue pointer at fixed address
+- processes must free all heap allocated memory before exit
diff --git a/stage3/fut/process.c b/stage3/fut/process.c
new file mode 100644
index 0000000..ea99ccf
--- /dev/null
+++ b/stage3/fut/process.c
@@ -0,0 +1,77 @@
+#define STACK_SIZE 65536
+#define CURRENT *((process *) 0x500)
+
+process process_current()
+{
+	return CURRENT;
+}
+
+static void process_delete(process p)
+{
+	free(p->stack);
+	free(p->code);
+	map_clear(&p->channels);
+}
+
+static void process_push(process p, u64 value)
+{
+	p->stack_ptr -= sizeof value;
+	*p->stack_ptr = value;
+}
+
+void process_exit()
+{
+	if (CURRENT->next == CURRENT)
+		panic("init exited");
+
+	CURRENT->prev->next = CURRENT->next;
+	CURRENT->next->prev = CURRENT->prev;
+	rc_drop(*current);
+
+	process_yield();
+}
+
+process process_create(char *path, display d)
+{
+	process p = rc_create(sizeof *p, &process_delete);
+
+	p->state = PROCESS_CREATED;
+
+	p->stack = malloc(STACK_SIZE);
+	p->stack_ptr = p->stack + STACK_SIZE;
+	p->code = p->code_ptr = file_read(path);
+
+	process_push(p, (u64) &process_exit);
+	// push 6 callee resaved registers - contents dont actually matter.
+	for (int i = 0; i < 6; i++)
+		process_push(p, 0);
+
+	p->displ = d;
+	p->next = p->prev = nil;
+	map_init(&p->channels);
+
+	channel sig = channel_create();
+	process_channel_add(p, "signal", sig);
+	rc_drop(sig);
+
+	channel stat = channel_create();
+	process_channel_add(p, "status", stat);
+	rc_drop(stat);
+
+	return p;
+}
+
+void process_start(process p)
+{
+	if (p->code_ptr == nil)
+		panic("attempt to start invalid process");
+
+	if (p->state != PROCESS_CREATED)
+		panic("attempt to start running or dead process");
+
+	rc_grab(p);
+
+	p->next = CURRENT->next;
+	CURRENT->next = p;
+	p->prev = CURRENT;
+}
diff --git a/stage3/fut/sys_kern.c b/stage3/fut/sys_kern.c
new file mode 100644
index 0000000..c7c5fcc
--- /dev/null
+++ b/stage3/fut/sys_kern.c
@@ -0,0 +1,21 @@
+#include <sys_kern.h>
+
+void link()
+{
+	void **calltable = 0x500;
+
+	calltable[0] = &display_current;
+	calltable[1] = &display_create;
+	calltable[2] = &display_add;
+	calltable[3] = &display_remove;
+	calltable[4] = &display_pixel;
+	calltable[5] = &display_channel_add;
+	calltable[6] = &display_channel_get;
+	calltable[7] = &rc_grab;
+	calltable[8] = &rc_drop;
+	calltable[9] = &rc_create;
+	calltable[10] = &weak_downgrade;
+	calltable[11] = &weak_upgrade;
+	calltable[12] = &weak_drop;
+	calltable[13] = &channel_create;
+}
diff --git a/stage3/fut/sys_kern.h b/stage3/fut/sys_kern.h
new file mode 100644
index 0000000..083fce3
--- /dev/null
+++ b/stage3/fut/sys_kern.h
@@ -0,0 +1,91 @@
+#ifndef _SYS_H_
+#define _SYS_H_
+
+// misc
+
+typedef struct {
+	i32 x, y;
+} pos;
+
+typedef struct {
+	u32 width, height;
+} bounds;
+
+typedef struct {
+	u8 r, g, b
+} color;
+
+// display
+
+typedef struct display {
+	pos p;
+	bounds b;
+	struct display *parent;
+	u64 index;
+} *display;
+
+display display_current();
+display display_create();
+void display_add(display parent, display child, i32 index);
+void display_remove(display child);
+
+void display_pixel(display d, pos p, color c);
+
+void display_channel_add(char *name, channel ch);
+channel display_channel_get(char *name);
+
+// rc
+
+typedef struct __attribute__((packed)) {
+	u32 ref;
+	u32 own;
+	void *data;
+	void (*delete)(void *data);
+} rc_header;
+
+void rc_grab(void *rc);
+void rc_drop(void *rc);
+
+void *rc_create(u64 siz, void *delete);
+void *weak_downgrade(void *rc);
+void *weak_upgrade(void *weak)
+void weak_drop(void *weak);
+
+// channel
+
+typedef struct {
+	array listeners;
+	array subscribers;
+} *channel;
+
+channel channel_create();
+
+// buffered
+
+typedef struct {
+	void *active;
+	array buffer;
+} buffered;
+
+// process
+
+typedef struct process __attribute__((packed)) {
+	void *code;
+	void *stack;
+	u64 *stack_ptr;
+	struct process *next;
+	struct process *prev;
+	map channels;
+	display displ;
+	enum {
+		PROCESS_CREATED,
+		PROCESS_RUNNING,
+		PROCESS_DEAD,
+	} state;
+} *process;
+
+// setup pointers
+
+void link();
+
+#endif
diff --git a/stage3/fut/sys_user.c b/stage3/fut/sys_user.c
new file mode 100644
index 0000000..4490513
--- /dev/null
+++ b/stage3/fut/sys_user.c
@@ -0,0 +1,36 @@
+#include <sys_user.h>
+
+display (*display_current)();
+display (*display_create)();
+void (*display_add)(display parent, display child, i32 index);
+void (*display_remove)(display child);
+void (*display_pixel)(display d, pos p, color c);
+void (*display_channel_add)(char *name, channel ch);
+channel (*display_channel_get)(char *name);
+void (*rc_grab)(void *rc);
+void (*rc_drop)(void *rc);
+void *(*rc_create)(u64 siz, void *delete);
+void *(*weak_downgrade)(void *rc);
+void *(*weak_upgrade)(void *weak)
+void (*weak_drop)(void *weak);
+channel (*channel_create)();
+
+void link()
+{
+	void **calltable = 0x500;
+
+	display_current = calltable[0];
+	display_create = calltable[1];
+	display_add = calltable[2];
+	display_remove = calltable[3];
+	display_pixel = calltable[4];
+	display_channel_add = calltable[5];
+	display_channel_get = calltable[6];
+	rc_grab = calltable[7];
+	rc_drop = calltable[8];
+	rc_create = calltable[9];
+	weak_downgrade = calltable[10];
+	weak_upgrade = calltable[11];
+	weak_drop = calltable[12];
+	channel_create = calltable[13];
+}
diff --git a/stage3/fut/sys_user.h b/stage3/fut/sys_user.h
new file mode 100644
index 0000000..3be3d58
--- /dev/null
+++ b/stage3/fut/sys_user.h
@@ -0,0 +1,91 @@
+#ifndef _SYS_H_
+#define _SYS_H_
+
+// misc
+
+typedef struct {
+	i32 x, y;
+} pos;
+
+typedef struct {
+	u32 width, height;
+} bounds;
+
+typedef struct {
+	u8 r, g, b
+} color;
+
+// display
+
+typedef struct display {
+	pos p;
+	bounds b;
+	struct display *parent;
+	u64 index;
+} *display;
+
+extern display (*display_current)();
+extern display (*display_create)();
+extern void (*display_add)(display parent, display child, i32 index);
+extern void (*display_remove)(display child);
+
+extern void (*display_pixel)(display d, pos p, color c);
+
+extern void (*display_channel_add)(char *name, channel ch);
+extern channel (*display_channel_get)(char *name);
+
+// rc
+
+typedef struct __attribute__((packed)) {
+	u32 ref;
+	u32 own;
+	void *data;
+	void (*delete)(void *data);
+} rc_header;
+
+extern void (*rc_grab)(void *rc);
+extern void (*rc_drop)(void *rc);
+
+extern void *(*rc_create)(u64 siz, void *delete);
+extern void *(*weak_downgrade)(void *rc);
+extern void *(*weak_upgrade)(void *weak)
+extern void (*weak_drop)(void *weak);
+
+// channel
+
+typedef struct {
+	array listeners;
+	array subscribers;
+} *channel;
+
+extern channel (*channel_create)();
+
+// buffered
+
+typedef struct {
+	void *active;
+	array buffer;
+} buffered;
+
+// process
+
+typedef struct process __attribute__((packed)) {
+	void *code;
+	void *stack;
+	u64 *stack_ptr;
+	struct process *next;
+	struct process *prev;
+	map channels;
+	display displ;
+	enum {
+		PROCESS_CREATED,
+		PROCESS_RUNNING,
+		PROCESS_DEAD,
+	} state;
+} *process;
+
+// setup pointers
+
+void link();
+
+#endif
diff --git a/stage3/fut/yield.asm b/stage3/fut/yield.asm
new file mode 100644
index 0000000..0c4a134
--- /dev/null
+++ b/stage3/fut/yield.asm
@@ -0,0 +1,49 @@
+global process_yield
+extern rc_drop
+
+%define CURRENT [0x500]
+
+section .text
+process_yield:
+	; save callee reserved regs to old stack
+	push rbx
+	push rbp
+	push r12
+	push r13
+	push r14
+	push r15
+
+	; get CURRENT
+	mov rdi, CURRENT
+
+	; set CURRENT->stack_ptr
+	mov rax, rdi
+	add rax, 16
+	mov [rax], rsp
+
+	; switch to new process
+	add rax, 8
+	mov rbx, [rax]
+	mov CURRENT, rbx
+
+	; activate new stack
+	add rbx, 16
+	mov rsp, [rbx]
+
+	; drop old process (=rdi)
+	call rc_drop
+
+	; grab new process
+	mov rdi, CURRENT
+	call rc_grab
+
+	; restore callee reserved registers
+	pop r15
+	pop r14
+	pop r13
+	pop r12
+	pop rbp
+	pop rbx
+
+	; jump into new process, with style
+	ret
diff --git a/stage3/gfx.c b/stage3/gfx.c
new file mode 100644
index 0000000..0ecf423
--- /dev/null
+++ b/stage3/gfx.c
@@ -0,0 +1,32 @@
+#include "gfx.h"
+
+struct GfxInfo *gfxinfo = (void *) (0x1000-10);
+
+// byteswap
+u32 make_color(color col)
+{
+	return ((u32) 0)
+		& ((u32) col.r << 0)
+		& ((u32) col.g << 8)
+		& ((u32) col.b << 16)
+		& ((u32) col.a << 24);
+}
+
+void set_pixel(u16 x, u16 y, u32 col)
+{
+	*((u32 *) (u64) (gfxinfo->framebuffer + y * gfxinfo->pitch + x * sizeof col)) = col;
+}
+
+void set_region(u16 x, u16 y, u16 w, u16 h, u32 col)
+{
+	void *cbeg = (void *) (u64) (gfxinfo->framebuffer + y * gfxinfo->pitch + x * sizeof col);
+	void *cend = cbeg + h * gfxinfo->pitch;
+
+	for (; cbeg < cend; cbeg += gfxinfo->pitch) {
+		void *rbeg = cbeg;
+		void *rend = rbeg + w * sizeof col;
+
+		for (; rbeg < rend; rbeg += sizeof col)
+			*((u32 *) rbeg) = col;
+	}
+}
diff --git a/stage3/gfx.h b/stage3/gfx.h
new file mode 100644
index 0000000..e4e5d8b
--- /dev/null
+++ b/stage3/gfx.h
@@ -0,0 +1,21 @@
+#ifndef _GFX_H_
+#define _GFX_H_
+
+#include "def.h"
+
+extern struct __attribute__((packed)) GfxInfo {
+	u16 pitch;
+	u16 width;
+	u16 height;
+	u32 framebuffer;
+} *gfxinfo;
+
+typedef struct {
+	u8 r, g, b, a;
+} color;
+
+u32 make_color(color col);
+void set_pixel(u16 x, u16 y, u32 col);
+void set_region(u16 x, u16 y, u16 w, u16 h, u32 col);
+
+#endif
diff --git a/stage3/halt.c b/stage3/halt.c
new file mode 100644
index 0000000..63ad8e2
--- /dev/null
+++ b/stage3/halt.c
@@ -0,0 +1,7 @@
+#include "halt.h"
+
+void halt()
+{
+	for (;;)
+		;
+}
diff --git a/stage3/halt.h b/stage3/halt.h
new file mode 100644
index 0000000..9521dd9
--- /dev/null
+++ b/stage3/halt.h
@@ -0,0 +1,6 @@
+#ifndef _HALT_H_
+#define _HALT_H_
+
+void halt();
+
+#endif
diff --git a/stage3/main.c b/stage3/main.c
new file mode 100644
index 0000000..7c84d05
--- /dev/null
+++ b/stage3/main.c
@@ -0,0 +1,34 @@
+#include "paging.h"
+#include "def.h"
+#include "gfx.h"
+#include "halt.h"
+
+void clear_screen(); // framebuffer.asm
+
+void kmain()
+{
+	clear_screen();
+
+	for (MemRegion *mmap = (void *) 0x500; mmap->start != nil; mmap++)
+		page_region(mmap);
+
+	page_region(&(MemRegion) {
+		.start = (void *) (u64) gfxinfo->framebuffer,
+		.size = gfxinfo->pitch * gfxinfo->height,
+		.type = MEM_RESERVED,
+		.zero = 0,
+	});
+
+	/*
+	for (u16 x = 0; x < gfxinfo->width; x++)
+	for (u16 y = 0; y < gfxinfo->height; y++)
+		set_pixel(x, y, 0x0087CEEB);
+	*/
+
+	set_region(0, 0, gfxinfo->width, gfxinfo->height, 0x0087CEEB);
+
+	halt();
+}
+
+// 0xE0000000
+// 0xE03E8000
diff --git a/stage3/memory.asm b/stage3/memory.asm
new file mode 100644
index 0000000..b4410a3
--- /dev/null
+++ b/stage3/memory.asm
@@ -0,0 +1,59 @@
+global memcpy, memmove
+
+section .text
+
+memcpy:
+.bulk_copy:
+	cmp rdx, 8
+	jl .bytewise_copy
+	mov rax, qword[rsi]
+	mov qword[rdi], rax
+	sub rdx, 8
+	add rdi, 8
+	add rsi, 8
+.bytewise_copy:
+	cmp rdx, 0
+	je .return
+	mov al, byte[rsi]
+	mov byte[rdi], al
+	dec rdx
+	inc rdi
+	inc rsi
+	jmp .bytewise_copy
+.return:
+	ret
+
+memmove:
+	mov rcx, rdx
+.bulk_read:
+	cmp rdx, 8
+	jl .bytewise_read
+	push qword[rsi]
+	add rsi, 8
+	sub rdx, 8
+	jmp .bulk_read
+.bytewise_read:
+	cmp rdx, 0
+	je .bulk_write
+	dec rsp
+	mov al, byte[rsi]
+	mov byte[rsp], al
+	inc rsi
+	dec rdx
+	jmp .bytewise_read
+.bulk_write:
+	cmp rcx, 8
+	jl .bytewise_write
+	pop qword[rdi]
+	add rdi, 8
+	sub rcx, 8
+.bytewise_write:
+	cmp rcx, 0
+	je .return
+	mov al, byte[rsp]
+	mov byte[rdi], al
+	inc rsp
+	inc rdi
+	dec rcx
+.return:
+	ret
diff --git a/stage3/paging.asm b/stage3/paging.asm
new file mode 100644
index 0000000..8b1d571
--- /dev/null
+++ b/stage3/paging.asm
@@ -0,0 +1,336 @@
+global page_region
+extern print_hex, print_chr, newline, print_dec, print_str
+
+section .text
+
+pagebuf_init:
+	.start: dq 0x5000
+	.size: dq 0x2000
+	.used: dq 0
+
+pagebuf: dq pagebuf_init
+
+next_page: dq 0
+
+; allocate new page table buffer
+alloc:
+	; rsi = buffer (result)
+	; rdi = next_page
+	; r8  = pagebuf
+	; rbx = upper
+	; rax = tmp; used_next
+
+	mov r8, [pagebuf] ; *pagebuf
+	mov rsi, [r8]     ; start = pagebuf->start
+
+	mov rbx, [r8+8]   ; size = pagebuf->size
+	add rbx, rsi      ; upper_have = start + size
+
+	; round *up* to 0x1000 align
+	mov rax, 0xfff
+	add rsi, rax
+	not rax
+	and rsi, rax      ; aligned_start = (start + 0xfff) & (~0xfff)
+
+	mov rax, [r8+16]  ; used = pagebuf->used
+	add rax, 0x1000
+	add rsi, rax      ; upper_need = aligned_start + used + 0x1000
+
+	cmp rsi, rbx      ; if upper_need > upper_have
+	ja .newbuf        ; current region is full, get new
+
+	cmp rsi, r10      ; if upper_need >= next_page
+	jae .oom          ; out of memory (target buffer isn't paged yet)
+
+	mov [r8+16], rax  ; pagebuf->used = used + 0x1000
+
+	; clear out buffer
+
+	mov rbx, rsi
+	sub rsi, 0x1000
+
+.clear:
+	sub rbx, 8
+	mov qword[rbx], 0
+	cmp rbx, rsi
+	jne .clear
+
+	ret
+
+; select next page buffer
+.newbuf:
+	cmp r8, pagebuf_init
+	jne .nextbuf
+
+	mov r8, 0x500
+	jmp .trybuf
+
+.nextbuf:
+	add r8, 24
+
+.trybuf:
+	cmp qword[r8], 0
+	je .oom       ; last region reached
+
+	mov rax, [r8+16]
+
+	cmp rax, -1
+	je .nextbuf   ; region is reserved
+
+	cmp rax, 0
+	jne .oom      ; region has not been paged yet
+
+	mov [pagebuf], r8
+	jmp alloc
+
+.oom:
+	push rdi
+
+	mov rdi, .oom_msg
+	call print_str
+
+	pop rdi
+
+	call print_hex
+	call newline
+
+	jmp $
+
+.oom_msg: db "out of memory for page table", 10, "next_page = ", 0
+
+; get/create page tables
+get_tables:
+; level 4
+
+	; rdi = address         (arg, persist)
+	; rax = tmp
+	; rbx = mask
+	; rcx = bits            (persist)
+	; rdx = level           (persist)
+	; r8  = table address
+	; rsi = next offset     (persist)
+
+	mov cl, 12+9*4
+	mov dl, 4
+
+	mov rsi, 0x1000
+
+; level 4
+.level:
+	dec dl
+	mov r8, rdi
+	mov rbx, -1           ; reset remainder mask
+	shl rbx, cl           ; update remainder mask
+	not rbx               ; negate remainder mask
+	and r8, rbx           ; apply remainder mask
+
+	mov al, 9
+	mul dl
+	add al, 12
+	mov cl, al
+
+	shr r8, cl            ; divide
+	shl r8, 3             ; multiply by 8
+
+	mov rbx, 0xfff        ; 0x1000 alignment
+	not rbx               ; offset mask
+
+	and rsi, rbx          ; apply offset mask
+	add r8, rsi           ; add offset
+	push r8               ; store
+
+	cmp dl, 0
+	je .done
+
+	mov rsi, [r8]         ; next offset
+	cmp rsi, 0
+	jne .level
+
+	call alloc
+	or rsi, 3
+	mov r8, [rsp]
+	mov [r8], rsi
+
+	jmp .level
+
+.done:
+	pop r11
+	pop r12
+	pop r13
+	pop r14
+
+	ret
+
+space:
+	mov dil, ' '
+	jmp print_chr
+
+page_region:
+	push rbx
+	push r12
+	push r13
+	push r14
+	push r15
+
+	mov r9, rdi
+
+	mov rdi, [r9]   ; ptr = mmap_entry->ptr
+	mov r10, [next_page]
+
+	push rdi
+
+	mov rax, 1 << 63
+
+	or rdi, rax
+	call print_hex
+	call space
+
+	mov rdi, [r9+8]
+	add rdi, [rsp]
+	or rdi, rax
+
+	call print_hex
+	call newline
+
+	pop rdi
+
+	; for   usable region (type = 1), set mmap_entry->used =  0
+	; for reserved region (type = 2), set mmap_entry->used = -1
+	xor rax, rax
+	xor rbx, rbx
+	mov eax, dword[r9+16]
+	cmp rax, 1
+	je .set_used
+	dec rbx
+.set_used:
+	mov [r9+16], rbx
+
+	mov r10, rdi
+	mov r15, rdi    ; r15 = end of region
+	add r15, [r9+8]
+
+	mov rax, 0xfff
+	not rax
+	and rdi, rax    ; round down to 0x1000 aligned
+
+	cmp rdi, r10
+	jb .get_tables
+
+	mov r10, rdi
+
+.get_tables:
+	call get_tables ; page tables into r11-r14
+
+	; start filling L1 map
+.l1:
+	mov rax, rdi
+	or rax, 3
+	mov [r11], rax
+
+	add rdi, 0x1000
+
+	cmp rdi, r10
+	jb .next
+
+	mov r10, rdi
+
+.next:
+	cmp rdi, r15    ; if next >= end
+	jae .done
+
+	; prepare rcx mask for later
+	mov rcx, -1
+	shl rcx, 3
+
+	; bump L1
+
+	add r11, 8
+	mov rax, r11
+	and rax, 0xfff
+	jnz .l1
+
+	; bump L2
+
+	add r12, 8
+	mov rax, r12
+	and rax, 0xfff
+	jnz .l2
+
+	; bump L3
+
+	add r13, 8
+	mov rax, r13
+	and rax, 0xfff
+	jnz .l3
+
+	; bump L4
+
+	add r14, 8
+	mov rax, r14
+	and rax, 0xfff
+	jnz .l4
+
+	; machine has more than 256TB of RAM, tell user to fuck off
+	jmp .bruh
+
+.l4:
+	mov r13, [r14]
+	and r13, rcx
+	jnz .l3
+
+	call alloc
+	mov r13, rsi
+	or rsi, 3
+	mov [r14], rsi
+
+.l3:
+	mov r12, [r13]
+	and r12, rcx
+	jnz .l2
+
+	call alloc
+	mov r12, rsi
+	or rsi, 3
+	mov [r13], rsi
+
+.l2:
+	mov r11, [r12]
+	and r11, rcx
+	jnz .l2
+
+	call alloc
+	mov r11, rsi
+	or rsi, 3
+	mov [r12], rsi
+
+	jmp .l1
+
+.done:
+	mov [next_page], r10
+
+	pop r15
+	pop r14
+	pop r13
+	pop r12
+	pop rbx
+
+	ret
+
+.bruh:
+	mov rdi, .bruh_msg
+	call print_str
+	jmp $
+
+.bruh_msg: db "bruh why do you have more than 256TB of RAM (you fucking glow)", 10, 0
+
+; identity map available memory
+old_page_map:
+	mov r9, 0x0500                ; mmap_entry
+.entry:
+	cmp qword[r9], 0
+	je .done
+	call page_region
+	add r9, 24
+	jmp .entry
+.done:
+	ret
diff --git a/stage3/paging.h b/stage3/paging.h
new file mode 100644
index 0000000..b9a3930
--- /dev/null
+++ b/stage3/paging.h
@@ -0,0 +1,20 @@
+#ifndef _PAGING_H_
+#define _PAGING_H_
+
+#include "def.h"
+
+typedef enum {
+	MEM_USABLE = 1,
+	MEM_RESERVED = 2,
+} MemRegionType;
+
+typedef struct __attribute__((packed)) {
+	void *start;
+	usize size;
+	u16 type;
+	u16 zero;
+} MemRegion;
+
+void page_region(MemRegion *region);
+
+#endif