--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/3rdparty/utils/fpgarom/AUTOEXEC.BAS	Sat Feb 04 18:54:49 2017 +0100
@@ -0,0 +1,1 @@
+10 RUNM"TEST

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/3rdparty/utils/fpgarom/LICENSE	Sat Feb 04 18:54:49 2017 +0100
@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://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 <http://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:
+
+    {project}  Copyright (C) {year}  {fullname}
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://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
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/3rdparty/utils/fpgarom/README.md	Sat Feb 04 18:54:49 2017 +0100
@@ -0,0 +1,24 @@
+# Required utilities:
+
+* make
+* lwtools
+* A reasonably modern Nitros9 with the 'ccbkrn' module and Gary's SD drivers installed on /dd (default in modern Nitros9 builds).  "cat" or "dd" this rbf image to your SD card.  
+
+# Optional utilities:
+
+* toolshead
+* de1flash (for flashing de1 board from linux w/ the quartus gui)
+
+# To Install:
+
+* build the ROM image via "make rom.img".
+* burn the resultant file, rom.img to rom slot 2 of your CoCoFPGA. - this means burning rom.img to flash address 3fc000 in your cocofpga's flash ram.
+
+I use something like this:
+
+quartus_pgm -m jtag -o 'p;de1flash.sof'
+quartus_stp -t de1flash.tcl write rom.img@0x3fc000
+
+# To use:
+
+Set your cocofpga's switch to mpi slot 2 and turn it on.  It boots fast, so don't blink.
\ No newline at end of file

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/3rdparty/utils/fpgarom/boot.asm	Sat Feb 04 18:54:49 2017 +0100
@@ -0,0 +1,699 @@
+;;;
+;;;  Boot OS9 via CoCoBoot interface
+;;;
+;;;
+
+
+	include "sd.def"
+
+	export	prestart
+
+	import	start.bss
+	import  length.bss
+	
+CR	equ	13
+SP	equ	32
+	
+DBUF0	equ	$600			; we'll borrow some memory from basic
+DBUF1	equ	$700			; another buffer
+SCRPTR	equ	$0002		; point to the os screen pointer
+
+
+DD.BIT	equ	$6		; 2B no of sectors per cluster
+DD.NAM	equ	$1f		; 32B volume name field
+DD.DIR	equ	$8		; 3B descriptor cluster for root dir
+
+FD.SIZ	equ	$9		; 4B size of file in bytes
+	
+
+		.area	.bss
+root		rmb	3		; 3b lsn of root dir
+;; FCB - vars needed to control file access.
+sptr		rmb	2		; ptr to current segment
+dptr		rmb	2		; ptr to data buffer
+bcount	rmb	2		; number of bytes left in buffer
+fcounth	rmb	2		; number of bytes left in file (high word)
+fcount 	rmb	2		; number of bytes left in file (low word)
+cptr		rmb	2		; pointer in block (boot cpu address)
+blocks	rmb	1		; number of regular contigeous blocks
+block		rmb	1		; current block number
+dirbuf	rmb	32		;
+ksize		rmb	2		; "stacked" size of os9 boot file
+offset	rmb	3		; 3B offset of root partition
+stack1	rmb	64
+stackb
+
+		.area	.bounce
+BOUNCE	rmb	255
+
+		.area	.code
+prestart
+		jmp	start		; me first, but jump over DATA
+
+BOOT		fcn	"OS9Boot"
+KRN		fcn	"ccbkrn"
+str0		fcn	"Loading OS9Boot"
+str1		fcn	"Loading ccbkrn"
+str2		fcn	"Xfr Control to KRN..."
+str3		fcn	"CoCoBoot SDIO"
+str4		fcn	"Vol Name: "
+
+start
+		orcc	#$50		; shut off interrupts
+		clr	$ffa0		; set mmu bank 0 to phys 0
+		clr	$ffdf		; set SAM RAM mode
+		clr	$ffd9		; high speed poke
+;; clear ram vars
+		ldx	#start.bss
+a@		clr	,x+
+		cmpx	#(start.bss+length.bss)
+		bne	a@
+;; 
+		lds	#stackb	; set stack
+		ldx	#$ff90	; setup gimme
+		jsr	gime		;
+;; setup screen
+		jsr	scrSetup	; setup screen
+		ldx	#str3		; print banner
+		jsr	putscr		;
+;; init SD card
+		jsr	ll_init		
+		lbcs	initerr
+;; get LSN0
+		ldx	#DBUF0	; set disk arg
+		stx	DPTR
+		clr	LSN
+		clr	LSN+1
+		clr	LSN+2
+;; Test for CCPT
+		jsr	ccpttest
+;; try to mount os9 filesystem
+		jsr	getlsn
+;; print volume name
+		ldx	#str4
+		jsr	puts
+		ldx	#DBUF0+DD.NAM
+		jsr	putscr
+;; get root dir's lsn
+		ldx	#DBUF0+DD.DIR
+		ldu	#root
+		jsr	cpy3
+;; open boot file
+		ldx	#str0
+		jsr	puts
+		ldx	#BOOT
+		jsr	nopen
+		lbcs	fnferr
+		ldx	#dirbuf+$1d	; !!! replace with constant
+		ldu	#LSN		;
+		jsr	cpy3		; set LSN = lsn of dirent
+		jsr	open		; and open the file
+		ldd	fcounth	; check size 
+		lbne	toobig	; 
+;; calculate start address
+		ldd	fcount	; save os9 size for passing to KRN
+		std	ksize		;
+		ldd	#$f000	; f000 - fcount = start address
+		subd	fcount	;
+		clrb			; and round it down to near page boundary
+		tfr	d,x		; X = cpu load address
+		pshs	x		; push onto stack ( cpustart )
+		cmpx	#$2000		; cant go lower
+		lblo	toobig
+;; set calc init mmu for bounce routine
+		lsra			; make A = mmu reg no
+		lsra			; take top three bits
+		lsra			;
+		lsra			;
+		lsra			;
+		pshs	a		; push start mmu no ( cpustart mmustart )
+;; calc no of contigeous block for os9boot loading routine
+		ldb	#7		; A = no of contigeous block
+		subb	,s		;
+		stb	blocks	; save for loading routine
+;; calc beginning cpu address
+		ldd	1,s		; D = cpu start
+		anda	#$1f
+		addd	#$4000	; adjust for loader
+		std	cptr
+;; copy os9boot into memory
+b@		jsr	testload	; load os9boot into memory
+		jsr	putCR
+;; open krn file
+		ldx	#str1
+		jsr	puts
+		ldx	#KRN
+		jsr	nopen
+		bcs	fnferr
+		ldx	#dirbuf+$1d	; !!! replace with constant
+		ldu	#LSN		;
+		jsr	cpy3		; set LSN = lsn of dirent
+		jsr	open		; and open the file
+		ldx	fcounth	; check size of krn file
+		lbne	krnsize	; is way too big
+		ldx	fcount	; 
+		cmpx	#$f00		;
+		lbne	krnsize	; wrong size
+;; copy krn file into memory
+		ldx	#$f000
+		jsr	fload		; load ccbkrn into memory
+		jsr	putCR
+;; done with disk go high speed :(
+		clr	$ffd9
+;; clear out DP page
+		ldx	#0
+		clrb
+		jsr	memz
+;; set dp
+		tfr	b,dp
+;; set gime mirror
+		ldx	#$90
+		jsr	gime
+;; copy bounce routine down to RAM
+		ldx	#bounce
+		ldu	#BOUNCE
+		ldb	#bounceend-bounce
+c@		lda	,x+
+		sta	,u+
+		decb
+		bne	c@
+;; jump to OS9
+		ldx	#str2
+		jsr	putscr
+		jmp	BOUNCE
+
+	
+iloop	bra	iloop
+
+	
+fnferr	ldx	#p0@
+	jsr	puts
+a@	bra	a@
+p0@	fcn	": FNF Error!"
+
+initerr	ldx	#p0@
+	jsr	puts
+a@	bra	a@
+p0@	fcn	"Driver Init Error!"
+
+mnterr	ldx	#p0@
+	jsr	puts
+a@	bra	a@
+p0@	fcn	"LSN0: bad format!"
+
+toobig	ldx	#p0@
+	jsr	puts
+a@	bra	a@
+p0@	fcn	"Too Big!"
+
+krnsize
+	ldx	#p0@
+	jsr	puts
+a@	bra	a@
+p0@	fcn	"Wrong Size!"
+	
+
+;;; Test for presence of CCPT partitioning
+ccpttest
+	pshs	d,x
+	ldd	DBUF0		; get magic
+	cmpd	#$4343		; check for "CC"
+	lbne	no@
+	ldd	DBUF0+2		; check for "PT"
+	cmpd	#$5054
+	lbne	no@		;
+no@	ldx	#p0@
+	jsr	putscr
+	puls	d,x,pc
+p0@	fcn	"CCPT not found."
+
+	
+;;; Setup Screen for os9 (sigh)
+scrSetup
+	pshs	d,x
+	;; set colors: green on black
+	ldb	#$12
+	stb	$ffbc
+	ldb	#0
+	stb	$ffbd
+	;; clear a screen's worth of video memory
+	ldb	#$3b
+	stb	$ffa0
+	ldx	#$0000
+	ldd	#$2020
+a@	std	,x++
+	cmpx	#$0400
+	bne	a@
+	;; set screen pointer up
+	ldd	#8
+	std	SCRPTR
+	clr	$ffa0
+	puls	d,x,pc
+
+	
+;;; Setup memory with gimme setting, aka Do os9's work :(
+;;;   takes: X = address
+;;;   returns: nothing
+;;;   modifies: nothing
+gime
+	pshs	d,x,u
+	ldu	#table@
+	lda	#16
+a@	ldb	,u+
+	stb	,x+
+	deca
+	bne	a@
+	puls	d,x,u,pc
+table@	.dw	$6c00
+	.dw	$0000
+	.dw	$0900
+	.dw	$0000
+	.dw	$0320
+	.dw	$0000
+	.db	$00
+	.dw	$ec01
+	.db	$00
+
+;;; This bounce routine gets copied down into low memory
+;;;   is completes the memory map.  Plz jump to me.
+bounce			      ; ( cpustart mmustart )
+	;; setup mmu to how os9 expects it
+	clr	$ffa0		; phys block 0 is always mapped to $0000
+	puls	a		; get mmu start ( cpustart )
+	ldy	#$ffa0
+	leay	a,y		; Y = beginning mmu
+	ldb	#1		; 1 is first os9 system block
+a@	stb	,y+		; store bank no in mmu
+	cmpy	#$ffa7		; did we move to the last mmu block
+	beq	b@		; yes, then quit looping
+	incb			; increment bank no
+	bra	a@		; repeat	
+b@	ldb	#$3f		; and mmu7 is always $3f
+	stb	,y
+	;; find and jump to KRN module
+	ldx	$f009		; KRN relative start address
+	leax	$f000,x		; make it absolute
+	ldu	#ksize		; U = ptr to os9boot size
+	orcc	#$50		; really, really turn off interrupts
+	jmp	,x		; jump to kernel (bye!)
+bounceend
+
+
+
+
+;;; Read os9 file into memory
+;;;   takes: open os9 file,
+testload
+	pshs	d,x
+	ldb	#1		; set initial bank to 1
+	stb	block		;
+	stb	$ffa2		;
+	;; loop until EOF
+a@	ldx	cptr		; get block pointer
+	jsr	readb		; read a byte
+	bcs	out@		; done!
+	stb	,x+
+	stx	cptr
+	;; check for end of bank
+	cmpx	#$6000
+	bne	a@
+	;; end of bank
+	ldd	#$4000		; reset block pointer
+	std	cptr
+	dec	blocks		; any more blocks left
+	bne	b@
+	;; no more blocks left set $3f
+	ldb	#$3f
+	bra	c@
+b@	inc	block
+	ldb	block
+c@	stb	$ffa2		; set mmu
+	bra	a@
+out@	puls	d,x,pc
+
+;;; Read file into memory
+;;;   takes: X = address to load, file opened.
+;;;   modifies: nothing
+fload	pshs	b,x
+a@	jsr	readb
+	bcs	done@
+	stb	,x+
+	bra	a@
+done@	puls	b,x,pc
+
+
+	
+;;; open a file via a name
+;;;    takes: X = filename (zero termed)
+;;;    returns: dirbuf set to file's FD, C set on error.
+nopen
+	pshs	d,x,u
+	;; open root directory
+	ldx	#root
+	ldu	#LSN
+	jsr	cpy3
+	jsr	open
+	;; get a dirent into buffer
+	ldu	2,s		; U = filename
+b@	lda	#32
+	ldx	#dirbuf
+a@	jsr	readb
+	bcs	nfound@
+	stb	,x+
+	deca
+	bne	a@
+	jsr	os9toz
+	ldx	#dirbuf
+	jsr	strcmp
+	bcc	found@
+	bra	b@
+nfound@	coma
+	puls	d,x,u,pc
+found@	clra
+	puls	d,x,u,pc
+
+
+;;; zero mem
+;;;   takes: X = ptr, B = number of byte to zero
+;;;   returns: nothing
+;;;   modifies: nothing
+memz
+	pshs	b,x
+a@	clr	,x+
+	decb
+	bne	a@
+	puls	b,x,pc
+
+	
+
+;;; strcmp
+;;;   takes: X = zstring, U = zstring
+;;;   returns: C clear if equal
+strcmp
+	pshs	b,x,u
+a@	ldb	,x+
+	cmpb	,u+
+	bne	ne@		; not equal
+	tstb
+	beq	e@		; equal
+	bra	a@		; loop
+e@	clrb
+	puls	b,x,u,pc
+ne@	comb
+	puls	b,x,u,pc
+	
+;;; change dirbuf's name to a z-string
+os9toz
+	pshs	b,x
+	ldx	#dirbuf
+	tst	,x
+	beq	out@
+a@	ldb	,x+
+	bpl	a@
+	andb	#$7f
+	stb	-1,x
+	clr	,x
+out@	puls	b,x,pc
+	
+
+;;; Open file
+;;;   takes: LSN = lsn of file's FD
+;;;   returns: nothing
+open
+	pshs	d,x
+	ldx	#DBUF1		; load dbuf1 with file's FD
+	stx	DPTR
+	jsr	getlsn
+	ldd	#DBUF1+$10	; first segment
+	std	sptr		; save ptr
+	jsr	fill		; and get first sector
+	;; set fcount
+	ldd	DBUF1+FD.SIZ
+	std	fcounth
+	ldd	DBUF1+FD.SIZ+2
+	std	fcount
+	puls	d,x,pc
+
+;;; get one byte from file
+;;;   takes: nothing,
+;;;   returns: B = byte, C set on EOF
+readb
+	pshs	a,x
+	ldd	fcount		; is the entire file out of bytes?
+	beq	eof@
+	ldd	bcount
+	bne	a@		; if left don't refill
+	;; refill file's data buffer
+	jsr	fill
+	;; 
+a@	ldd	fcount
+	subd	#1
+	std	fcount
+	ldd	bcount
+	subd	#1
+	std	bcount
+	ldx	dptr
+	ldb	,x+
+	stx	dptr
+	clra
+	puls	a,x,pc
+eof@	coma
+	puls	a,x,pc
+	
+	
+fill
+	pshs	d,x,u		; save regs
+	jsr	spin1
+	ldx	sptr
+	ldd	3,x		; get sector count
+	bne	a@		; no more secs left in seg?
+	;; get next segment
+	ldx	sptr
+	leax	5,x
+	stx	sptr
+	;; fill buffer
+a@	ldx	sptr		; copy segment's LSN to args
+	ldu	#LSN		;
+	jsr	cpy3		;
+	ldx	#DBUF0		; set data buffer
+	stx	DPTR		;
+	jsr	getlsn		; and get the sector
+	;; increment segment
+	ldx	sptr		; increment segment's LSN
+	jsr	inc3		; 
+	ldd	3,x		; decrement segment's sector count
+	subd	#1		;
+	std	3,x		;
+	;; set file dirs
+	ldd	#256
+	std	bcount
+	ldd	#DBUF0
+	std	dptr
+	puls	d,x,u,pc	; return
+	
+
+;;; Spin the ticker
+;;;   takes: nothing
+;;;   returns: nothing
+;;;   modifies: nothing
+spin1
+	pshs	b
+	ldb	#'.
+	jsr	putc
+	puls	b,pc
+
+	
+;;; Copy 3 bytes value
+;;;   take: X = src ptr, U = dst ptr
+;;;   modifies: nothing
+cpy3
+	pshs	d,x,u
+	ldd	,x++
+	std	,u++
+	ldb	,x
+	stb	,u
+	puls	d,x,u,pc
+
+	
+;;; Add 3 byte value store result in X ptr
+;;;   takes: X = 3B ptr, U = 3B ptr
+;;;   modifies: nothing
+add3
+	pshs	d
+	ldd	1,u
+	addd	1,x
+	std	1,x
+	ldb	,u
+	adcb	,x
+	stb	,x
+	puls	d,pc
+	
+
+
+;;; increment 3 byte value by one
+;;;  takes: X = ptr to 3 bytes
+;;;  returns: nothing
+inc3
+	pshs	d,x
+	ldd	1,x
+	addd	#1
+	std	1,x
+	ldb	,x
+	adcb	#0
+	stb	,x
+	puls	d,x,pc
+	
+
+;;; deblocker to translate 256B LSN to a 512B LSN
+;;;   takes: args in LSN/DPTR
+;;;   modifies: nothing
+getlsn
+	pshs	b,x
+	ldx	#LSN		; get pointer
+	lsr 	,x+
+	ror	,x+
+	ror	,x+
+	ldb	#1		; 256b lower read
+	bcc	a@
+	negb
+a@	stb	SMALL
+	ldx	#LSN		; add partition offset
+	ldu	#offset
+	jsr	add3
+	jsr	ll_read
+	puls	b,x,pc
+	
+
+
+;;; Dump 128 byte to screen
+;;;   takes: X = ptr to data
+;;;   modifies: nothing
+dump
+	pshs	d,x
+	jsr	putCR
+	lda	#8
+	pshs	a		; put row counter
+b@	lda	#8		; column counter
+	pshs	x
+a@	ldb	,x+
+	jsr	putb
+	jsr	putSP
+	deca
+	bne	a@
+	puls	x
+	clr	8,x
+	jsr	putscr
+	dec	,s
+	bne	b@
+	leas	1,s
+	puls	d,x,pc
+
+;;; Print a Space
+putSP
+	pshs	b
+	ldb	#SP
+	jsr	putc
+	puls	b,pc
+
+	
+;;; Print a CR
+putCR
+	pshs	d
+	ldb	#$3b
+	stb	$ffa0
+	ldd	SCRPTR
+	addd	#32-8
+	andb	#~$1f
+	addd	#8
+	std	SCRPTR
+	clr	$ffa0
+	puls	d,pc
+
+
+;;; Print a Z string
+;;;   takes: X = ptr to string
+;;;   modifies: nothing
+puts
+	pshs	b,x
+a@	ldb	,x+
+	beq	done@
+	jsr	putc
+	bra	a@
+done@	puls	b,x,pc	
+	
+;;; Print a 3 byte value ( in hex )
+;;;   takes: X = ptr to value
+;;;   modifies: nothing
+put3
+	pshs	d,x
+	ldd	,x++
+	jsr	putw
+	ldb	,x
+	jsr	putb
+	puls	d,x,pc
+	
+
+;;; Print a word ( in hex)
+;;;   takes: D = word
+;;;   modifies: nothing
+putw
+	pshs	b
+	tfr	a,b
+	bsr	putb
+	puls	b
+	bsr	putb
+	rts
+	
+;;; Print a byte (in hex)
+;;;   takes: B = byte
+;;;   modifies: nothing
+putb
+	pshs	d
+	lsrb
+	lsrb
+	lsrb
+	lsrb
+	bsr	putn
+	ldb	1,s
+	bsr	putn
+	puls	d,pc
+
+;;; Print a Char
+;;;   takes: B = charactor
+;;;   modifies: nothing
+putc
+	pshs	d,x
+	lda	#$3b		; put 3b in bank 0
+	sta	$ffa0
+	ldx	SCRPTR
+	stb	,x+
+	stx	SCRPTR
+	clr	$ffa0		; put 0 in bank 0
+	puls	d,x,pc
+	
+	
+;;; Print a nibble
+;;;   takes: B = nibble
+;;;   modifies: nothing
+putn
+	pshs	b
+	andb	#$f
+	addb	#$30
+	cmpb	#$39
+	bls	a@
+	addb	#7
+a@	jsr	putc
+	puls	b,pc
+	
+
+;;; Print a string followed by a CR
+;;;   takes: X = zero termed string
+;;;   returns: nothing
+;;;   modifies: nothing
+putscr
+	jsr	puts
+	jsr	putCR
+	rts
+	
+
+	

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/3rdparty/utils/fpgarom/makefile	Sat Feb 04 18:54:49 2017 +0100
@@ -0,0 +1,53 @@
+# A makefile for booting os9
+
+include ../../../rules.mak
+
+DEPENDS		:= ./makefile
+
+ALLJOBS	= FPGABOOT.BIN fpgaboot.rom
+
+DSKFPGABOOT	= fpgaboot.dsk
+
+DSKS		= $(DSKFPGABOOT)
+
+all: banner $(ALLJOBS) $(DEPENDS)
+
+banner:
+	@$(ECHO) "**************************************************"
+	@$(ECHO) "*                                                *"
+	@$(ECHO) "*       Brett Gordon's CocoFPGA Boot ROM         *"
+	@$(ECHO) "*                                                *"
+	@$(ECHO) "**************************************************"
+
+fpgaboot.rom: rom.asm FPGABOOT.BIN
+	lwasm -fraw -ofpgaboot.rom -mrom.map rom.asm
+
+$(DSKFPGABOOT): FPGABOOT.BIN AUTOEXEC.BAS
+	$(RM) $@
+	decb dskini $@
+	decb copy -b -2 FPGABOOT.BIN $@,FPGABOOT.BIN
+	decb copy -a -0 -l AUTOEXEC.BAS $@,AUTOEXEC.BAS
+	decb copy -b -2 fpgaboot.rom $@,FPGABOOT.ROM
+
+boot.bin: boot.asm sd.asm
+	lwasm -mboot.map -oboot.bin boot.asm
+
+FPGABOOT.BIN: boot.asm sd.asm test.lnk
+	lwasm -fobj -oboot.o boot.asm
+	lwasm -fobj -osd.o   sd.asm
+	lwlink -mtest.map -oFPGABOOT.BIN -stest.lnk -b boot.o sd.o
+
+dsk: all $(DSKS)
+
+dskcopy: dsk
+	$(CP) $(DSKS) $(DSKDIR)
+
+dskclean:
+	$(RM) $(DSKS)
+
+clean: dskclean
+	$(RM) $(ALLJOBS) *.o rom.map test.map
+
+info:
+	@$(ECHO) "*** Brett Gordon's CocoFPGA Boot ROM ***"
+	@$(foreach dsk, $(DSKS), $(ECHO) $(dsk);)

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/3rdparty/utils/fpgarom/notes.txt	Sat Feb 04 18:54:49 2017 +0100
@@ -0,0 +1,11 @@
+
+
+
+***********************************
+TODO
+***********************************
+
+* make load os9 by physical block, and put a jump routine for remaping the
+  memory to trampoline to the kernel - this will allow for a max sized os9 kernel, whatever that is.
+
+

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/3rdparty/utils/fpgarom/rom.asm	Sat Feb 04 18:54:49 2017 +0100
@@ -0,0 +1,25 @@
+;;;
+;;;  This sits in a DECB ROM and loads the bootloader
+;;;  from the end of this binary down to it's proper place
+;;;
+
+	org	$c000		; is a ROM
+	.ascii  'DK'		; is a DECB-look-a-like ROM
+	jmp	start	        ; jump over the garbage
+	fill    $ff,9*256	; this is area that Super Basic trashes
+start	ldx	#payload	; get address of payload
+pre	lda	,x+		; check flag
+	bne	post		; is end so post processes
+	ldy	,x++		; get size
+	ldu	,x++		; get address
+loop	ldb	,x+		; get a byte
+	stb	,u+		; move the byte
+	leay	-1,y		; bump counter
+	bne	loop		; move another if not done
+	bra	pre		; get next block header
+post	ldx	2,x		; X = execution address of binary
+	jmp	,x		; and jump to it
+payload
+	includebin "FPGABOOT.BIN"
+
+	fill	$ff,$e000-*	; pad to 8k

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/3rdparty/utils/fpgarom/sd.asm	Sat Feb 04 18:54:49 2017 +0100
@@ -0,0 +1,452 @@
+;;; Simple sd/spi driver.  Lifted from Gary Becker's
+;;; Nitros9 drivers.
+;;;
+;;;  This will deblock 256 bytes, but only on reads -
+;;;  there is no provision for writing partial sectors.
+;;;
+;;;  To use Run-Time:
+;;;    * load up the public interface variables, call ll_read
+;;;    * LSN address is always in 512B sectors nos.
+;;;
+
+		export	DPTR
+		export	LSN
+		export	SMALL
+		export	ll_read
+		export	ll_init
+
+EIO		equ		1	; Error on Read
+EWP		equ		2	; Error on Write Protect
+ENR		equ		3	; Error on Not Ready
+IntMasks	equ		$50	; shut off firq,irq interrupts
+HwBase	equ		$ff64	; hardware base address
+Carry		equ		$1	; CC's carry bit
+
+		.area	.bss
+;;; Public interface variables
+DPTR		rmb		2	; data address
+LSN		rmb		3	; 24 bit lsn :(
+SMALL		rmb		1	; 0=512B read, 1=256B read, -1=256B 2nd 1/2 read
+
+;;; Internal interface
+SDVersion	RMB		1	; 0 = Byte Addressable SD
+					; !0 = Sector Addressable SD
+CMDStorage	RMB		1	; Command storage area for read/write CMDs
+SD_SEC_ADD	RMB		4	; Four bytes - some devices are byte addressable
+CMDCRC	RMB		1	; CRC
+
+	.area .code
+;;; A Table of pre-done 6 byte commands
+;;;   This is const
+CMD0     fcb   $40,$00,$00,$00,$00,$95
+*CMD1     fcb   $41,$00,$00,$00,$00,$95
+CMD8     fcb   $48,$00,$00,$01,$AA,$87
+*CMD13    fcb   $4D,$00,$00,$00,$00,$95
+CMD16    fcb   $50,$00,$00,$02,$00,$FF
+ACMD41V1 fcb   $69,$00,$00,$00,$00,$FF
+ACMD41V2 fcb   $69,$40,$00,$00,$00,$FF
+CMD55    fcb   $77,$00,$00,$00,$00,$FF
+CMD58    fcb   $7A,$00,$00,$00,$00,$FF
+
+* Read/Write commands
+CMDRead         EQU         $5100  Command to read a single block
+CMDWrite        EQU         $5800  Command to write a sector
+CMDEnd          EQU         $00FF  Every command ends with $95
+* SPI Address Equates
+* SPI Control Register
+SPICTRL         EQU         0
+SLOT_SEL_0      EQU         1
+SPI_IRQ_EN      EQU         $40
+SPI_EN          EQU         $80   	Sets SPI enable and IRQ enable
+* SPI Status Register
+SPISTAT         EQU         0
+CARD_DET_0      EQU         1
+CARD_LOCK_0     EQU         2
+IRQ_SLOT_0      EQU         $80
+* SPI Transmit / Receive Register
+SPIDAT          EQU         1
+
+
+;;; ll_read - Low level read routine
+;;;   takes: parameters in public interface
+;;;   returns: C set on error, B = error
+;;;   modified: all 
+ll_read
+        orcc    #IntMasks       ; disable interrupts
+        ldx     #HwBase         ; Get address of hardware
+        lda     SPISTAT,x       ; check for card
+        lsra
+        lbcc    NOTRDY	        ; No card installed, so no reads
+d@      ldd     #CMDRead
+        std     CMDStorage      ; Read command and clear MSB of address
+        ldd     #CMDEnd
+        std     SD_SEC_ADD+3    ; Clear LSB of address and CRC
+        lda     #(SPI_EN+SLOT_SEL_0) ; but not IRQ enable
+        bsr     LSNMap0         ; apply the approipraite LSN, send cmd
+        lbcs    IOERR           ; If we timed out, branch with error
+        lbne    IOERR           ; If the R1 was not 0
+        ;; wait for a FE
+a@      lda     SPIDAT,x        ; Send FF (receive a byte) until we get FE
+        cmpa    #$FE            ; is FE
+        nop                     ; 
+        bne     a@              ; no: loop
+        ;; read bytes
+        ldy     DPTR	        ; Get the sector buffer address
+        tst     SMALL           ; small blocks?
+        beq     read512@        ; no go read all 512
+	bmi	otherhalf@	; go read second 1/2
+        bsr     read256         ; read 1st half of sector
+        bsr     drop256         ;
+        bra     b@              ; continue
+otherhalf@
+        bsr     drop256         ; read 2nd half of sector
+        bsr     read256         ;
+        bra     b@              ; continue
+read512@
+        bsr     read256         ; read all 512 bytes of sector
+        bsr     read256         ;
+        ;; get CRC      
+b@      lda     SPIDAT,x        ; Send 2x FF to get the CRC
+	nop
+	nop
+        lda     SPIDAT,x        ; We ignore the CRC
+        ;;; No errors, exit
+c@      lbra	RETOK
+	;; Errors, exit
+
+	
+;;; Read 256 bytes
+;;;   takes: Y = ptr to data
+;;;   takes: X = hwbase
+;;;   modifies: Y, B, A
+read256
+        ldb     #128            ; counter 128
+a@      lda     SPIDAT,x        ; get one byte
+        sta     ,y+             ; store in buffer
+        lda     SPIDAT,x        ; get another byte
+        sta     ,y+             ; store in counter
+        decb                    ; bump counter
+        bne     a@              ; not done? then loop
+        rts                     ; return
+
+;;; Drop 256 bytes
+;;;   takes: Y = ptr to data
+;;;   takes: X = hwbase
+;;;   modifies: Y, B, A
+drop256
+        ldb     #128            ; counter = 128
+a@      lda     SPIDAT,x        ; get one byte
+        nop                     ; delay
+        nop                     ; delay
+        lda     SPIDAT,x        ; get another byte
+        decb                    ; bump counter
+        bne     a@              ; not done? then loop
+        rts                     ; return
+
+
+;;; Map LSN into command buffer, sends command
+;;;   takes: A = CNTL bits, command packet loaded (except lsn)
+;;;   returns: C set on error, Z = 0 on R1 error ?
+;;;   modifies: A
+;;; 
+;;; SD/MMC uses a 32 bit byte mapping for the LSN, so we must shift the
+;;; logical LSN up one bit and then clear the 4th byte to build the
+;;; correct LSN string
+;;;
+;;; SDHC uses a 32 bit 512 byte sector mapping for the LSN.So there is
+;;; no need to shift the LSN we can just write it as is and clear out the
+;;; upper LSN byte, because we only get 3 bytes from coco for LSN
+LSNMap0
+        sta     SPICTRL,x            
+        nop
+        lda     SPIDAT,x	; Send 1 FF
+	lda     SDVersion        
+	bne     secadd		; GoTo Sector Address type
+	;; Apply lsn to byte addressing mmc
+	ldd     LSN+1           ; bytes 1 and 2 (middle and LSB)
+	aslb                    ; Byte address needs to be shifter one more bit
+	rola
+	std     SD_SEC_ADD+1    ; save in byte 1,2
+	lda     LSN             ; calc MSB
+	rola
+	sta     SD_SEC_ADD      ; store in byte 0
+	bra     merge
+	;; apply lsn to sector addressing SD/HC
+secadd	ldd     LSN+1           ; just copy it
+	std     SD_SEC_ADD+2
+	lda     LSN
+	sta     SD_SEC_ADD+1
+	;; two method merge here
+merge	lda     SPIDAT,x        ; Send 1 FF
+	ldy     #CMDStorage
+	;; Fall through to cmdsend
+	
+* cmdsend - Sends a 6 byte command
+* Entry:  X = HW addr
+*         Y = Address of first byte of command sequence
+* Exit:
+* Registers preserved: all but A/B/X
+cmdsend
+	lda	    ,y
+	sta         $FF66
+	ldb         #6
+a@	lda         ,y+
+	sta         SPIDAT,x
+	decb
+	bne         a@
+	andcc       #^Carry     ; Clear Carry
+	ldb         #$00        ; Probably too much
+b@	lda         SPIDAT,x	; send FF, wait till + flipped 7 bit
+	bpl         c@		;
+	decb			; bump counter
+	bne         b@		; not done, loop
+	comb			; set carry for error
+c@	rts			; return
+
+* ll_write - Low level write routine
+*
+* Entry:
+*    Registers:
+*    Static Variables of interest:
+*      PhysSect = starting physical sector to write to
+*      SectSize = physical sector size (0=256,1=512,2=1024,3=2048)
+*
+* Exit:
+*    All registers may be modified
+*    Static variables may NOT be modified
+ll_write
+	orcc    #IntMasks       ; disable interrupts
+	ldx     #HwBase         ; Get address of hardware
+	lda     SPISTAT,x
+	lsra
+	lbcc    NOTRDY 		; no card - go not ready
+	lsra			; bit one is WP
+	lbcs    WPERR		; Write Protected, then exit with WP error
+	ldd     #CMDWrite	; load up write command
+	std     CMDStorage	;
+	ldd     #CMDEnd		; put LSB of LSN and CRC :)
+	std     SD_SEC_ADD+3	;
+	lda     #(SPI_EN+SLOT_SEL_0)
+	bsr     LSNMap0		; apply the appropriate LSN, sends cmd
+	bcs     IOERR		; error?
+	bne     IOERR		; error?
+	lda     SPIDAT,x        ; 2 bytes >= 1 byte after R1
+	nop                     ; Might not be enough ?????
+	nop
+	lda     SPIDAT,x
+	lda     #$FE     	; Start of sector byte and clear counter 
+	sta     SPIDAT,x        ; Mark the start of the sector
+	nop                     ; Too much ???????
+	;; Write the 512 Byte sector
+	ldy	DPTR		; Y = data buffer
+	clrb			; B = 256 byte counter
+a@      lda     ,y+		; get a byte from buffer
+	sta     SPIDAT,x	; write it to SD
+	nop			; wait a bit
+	lda     ,y+		; get another byte from buffer
+	sta     SPIDAT,x	; write it
+	decb			; bump counter
+	bne     a@		; repeat if not done
+	;; get crc
+	lda     SPIDAT,x        ; send two FFs as CRC
+	nop
+	nop                     ; Might not be enough ???????
+	stb     SPIDAT,x        ; Second FF (send 0 to check)
+	cmpa    #$E5            ; Response - Data accepted token
+	beq     fnd0            ; First byte? no? check four more bytes.
+	;; Make sure the response was accepted
+	lda     SPIDAT,x	; get response
+	cmpa    #$E5            ; Data accepted token
+	beq     fnd0            ; 
+	lda     SPIDAT,x	; check again
+	cmpa    #$E5            ; 
+	beq     fnd0            ; 
+	lda     SPIDAT,x	; check again
+	cmpa    #$E5            ; 
+	beq     fnd0            ; 
+	lda     SPIDAT,x	; check again
+	cmpa    #$E5            ; 
+	bne     IOERR           ; Write error
+	;; Check to see if the write is complete
+fnd0    lda     SPIDAT,x
+	beq     lpwr2		; could be a bne but
+	bra     fnd0            ; I want the extra cycles
+lpwr2   lda     SPIDAT,x
+	cmpa    #$FF
+	beq     wfin
+	bra     lpwr2
+wfin    ldb     #10             ; Lets send 16 more FF just in case
+b@   	lda     SPIDAT,x
+	decb
+	bne     b@
+	;; No error so exit
+	bra	RETOK
+	
+* Error handlers
+
+RETOK	ldd	#$0000		; return the disaster of No Error
+	clr	SPICTRL,x
+*	andcc	#^IntMasks
+	clra
+	rts
+
+WPERR	ldd	#$0000+EWP
+	bra	a@
+IOERR
+	ldd	#$0000+EIO
+	bra	a@
+NOTRDY
+	ldd     #$0000+ENR
+a@
+	sta     SPICTRL,x       ; Set the hardware
+*	andcc   #^IntMasks      ; Enable interrupts
+	coma                    ; Set Carry
+	rts
+
+	
+* ll_init - Low level init routine
+* Entry:
+*    Y  = address of device descriptor
+*    U  = address of low level device memory area
+*
+* Exit:
+*    CC = carry set on error
+*    B  = error code
+*
+* Note: This routine is called ONCE: for the first device
+* IT IS NOT CALLED PER DEVICE!
+*
+
+ll_init
+	orcc    #IntMasks       ; disable interrupts
+	ldx     #HwBase		; load x with the hw address for the IRQ routine
+	lda     SPISTAT,x
+	lsra
+	bcc     NOTRDY		; If there is no card, nothing to do
+	;; Enable SPI
+	lda     #SPI_EN		; Enable SPI Interface, but not CS
+	sta     SPICTRL,x
+	;; send 74 clock cycles, no SS
+	ldb	#$10
+a@	lda     SPIDAT,x        ; Send FF
+	decb                    ; 2 cycles, need 4
+	nop
+	bne     a@              ; 3 Cycles
+	;; Initialize card 0
+CRD0	lda     #SPI_EN+SLOT_SEL_0 ; Enable SPI and lower CS
+	sta     SPICTRL,x
+	;; Send CMD0
+	lda	SPIDAT,x        ; Send 1 FF
+	nop                     ; ????????? enough
+	ldy     #CMD0           ; Might need more cycles ???????
+	lda     SPIDAT,x        ; Send 1 more FF
+
+	lbsr    cmdsend         ; Also does a GETR1
+
+	bcs     NOTRDY
+	anda    #$7E            ; Idle is ok
+	bne     NOTRDY          ; but nothing else
+	;; Send CMD8
+	lda     SPIDAT,x        ; Send 1 FF
+	nop
+	ldy     #CMD8           ; Might need more cycles ??????
+	lda    	SPIDAT,x        ; Sens 1 more FF
+	lbsr    cmdsend         ; Also does an GETR1
+	bcs     SDV1
+	anda    #$7E
+	bne     SDV1
+	lda     SPIDAT,x        ; Byte 1 of R3/R7, through it away
+	nop
+	nop
+	nop
+	lda     SPIDAT,x    	; Byte 2 of R3/R7, throught it away
+	nop
+	nop
+	nop
+	lda     SPIDAT,x        ; Byte 3 of R3/R7, should be 1
+	cmpa    #$01            ; 2 cycles
+	bne     NOTRDY          ; 2 cycles
+	nop
+	lda     SPIDAT,x        ; Byte 4 of R3/R7, should be $AA
+	cmpa    #$AA            ; 2 cycles
+	bne     NOTRDY          ; 2 cycles
+	nop
+	;; Send ACMD41 by first CMD55
+loop41V2
+        lda     SPIDAT,x        ; Send 1 FF
+	nop
+	ldy     #CMD55          ; might need more ??????
+	lda     SPIDAT,x        ; Send 1 FF
+	lbsr    cmdsend         ; Also does an GETR1
+	bcs     NOTRDY
+	anda    #$7E            ; Idle is ok
+	bne     NOTRDY          ; but nothing else
+	;; Send ACMD41
+	lda     SPIDAT,x
+	nop
+	ldy     #ACMD41V2
+	lda     SPIDAT,x
+	lbsr    cmdsend
+	bcs     NOTRDY          ; No response
+	beq     Send58          ; If 0 then CMD58
+	cmpa    #$01            ; if 1 then try again
+	beq     loop41V2
+	lbra    NOTRDY
+	;; Send CMD58 
+Send58	lda     SPIDAT,x
+	nop             
+	ldy     #CMD58          ; Read OCR
+	lda     SPIDAT,x
+	lbsr    cmdsend
+	lbcs    NOTRDY
+	lda     SPIDAT,x        ; Byte 1 of OCR
+	anda    #$40            ; CCS bit 1= sector 0= byte
+	sta     SDVersion
+	lda     SPIDAT,x        ; Byte 2 of R3/R7, through it away
+	nop
+	nop
+	lda     SPIDAT,x        ; Byte 3 of R3/R7, through it away
+	nop
+	nop
+	lda     SPIDAT,x        ; Byte 4 of R3/R7, through it away
+	lda     SDVersion       ; 0 = byte addressable, !0 = block addressable
+	bne     FININIT
+	bra     Send16
+	;; Send ACMD41 by first CMD55
+SDV1
+loop41V1
+        lda     SPIDAT,x        ; Get extra bytes in case of bad R7 previously
+	nop
+	lda     SPIDAT,x
+	clr     SDVersion       ; Byte addressable
+	lda     SPIDAT,x
+	ldy     #CMD55
+	lda     SPIDAT,x
+	lbsr    cmdsend
+	lbcs    NOTRDY
+	anda    #$7E            ; Idle is ok
+	lbne    NOTRDY          ; but nothing else
+	;; send ACMD41
+	lda     SPIDAT,x
+	ldy     #ACMD41V1
+	lda     SPIDAT,x
+	lbsr    cmdsend
+	lbcs    NOTRDY
+	beq     Send16          ; If 0 then CMD16
+	cmpa    #$01            ; if 1 then try again
+	beq     loop41V1
+	lbra    NOTRDY
+	;; send CMD16
+	* Send CMD16
+Send16  lda     SPIDAT,x
+	ldy     #CMD16
+	lda     SPIDAT,x
+	lbsr    cmdsend
+	lbne    NOTRDY          ; but nothing else
+	;; finished
+FININIT	lda     SPIDAT,x        ; Send last FF
+	nop
+	nop
+	lda     #SPI_EN         ; Turn on SPI and turn off CS
+	sta     SPICTRL,x
+	rts

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/3rdparty/utils/fpgarom/sd.def	Sat Feb 04 18:54:49 2017 +0100
@@ -0,0 +1,8 @@
+
+
+
+	extern DPTR		; uint16 data address
+	extern LSN		; uint24 LSN
+	extern SMALL		; int8:  0=512B read, 1=256B read, -1=256B 2nd 1/2 read
+	extern ll_read		; call to do a read with above set.
+	extern ll_init		; call to initialize SD driver
\ No newline at end of file

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/3rdparty/utils/fpgarom/test.asm	Sat Feb 04 18:54:49 2017 +0100
@@ -0,0 +1,620 @@
+;;;
+;;;  Boot OS9 via CoCoBoot interface
+;;;
+;;;
+
+CR	equ	13
+SP	equ	32
+	
+DBUF0	equ	$600		; we'll borrow some memory from basic
+DBUF1	equ	$700		; another buffer
+SCRPTR	equ	$0002		; point to the os screen pointer
+
+DD.BIT	equ	$6		; 2B no of sectors per cluster
+DD.NAM  equ	$1f		; 32B volume name field
+DD.DIR	equ	$8		; 3B descriptor cluster for root dir
+
+FD.SIZ	equ	$9		; 4B size of file in bytes
+
+
+;;;
+;;;
+;;;  Low Ram Variables
+;;; 
+;;; 
+	org	$2000
+RAM	equ	*
+root	rmb	3		; 3b lsn of root dir
+	;; FCB - vars needed to control file access.
+sptr	rmb	2		; ptr to current segment
+dptr	rmb	2		; ptr to data buffer
+bcount	rmb	2		; number of bytes left in buffer
+fcounth	rmb	2		; number of bytes left in file (high word)
+fcount 	rmb	2		; number of bytes left in file (low word)	
+	;; and a buffer for directory entries
+dirbuf	rmb	32		;	
+ksize	rmb	2		; "stacked" size of os9 boot file
+stack	rmb	64
+stackb				; bottom of stack
+
+;;;
+;;;
+;;; Code
+;;;
+;;; 
+
+	
+	org	$c000		; sit low
+prestart
+	jmp	start		; me first, but jump over DATA
+
+
+BOOT	fcn	"OS9Boot"
+KRN	fcn	"ccbkrn"
+str0	fcn	"Loading OS9Boot"
+str1	fcn	"Loading ccbkrn"
+str2	fcn	"Xfr Control to KRN..."
+str3	fcn	"CoCoBoot SDIO"
+str4	fcn	"Vol Name: "
+
+start
+	orcc	#$50		; shut off interrupts
+	lds	#stackb		; set stack
+	;; clear RAM vars
+	ldx	#RAM
+	ldb	#stack-RAM
+	jsr	memz
+	;; 
+	ldx	#$ff90		; setup gimme
+	jsr	gime		;
+	clr	$ffa0		; set mmu bank 0 to phys 0
+*	clr	$ffdf		; set SAM RAM mode
+	;; setup screen
+	jsr	scrSetup	; setup screen
+	ldx	#str3		; print banner
+	jsr	putscr		;
+x@	bra	x@
+	;; init SD card
+	jsr	ll_init		
+	lbcs	initerr
+	;; get LSN0
+	ldx	#DBUF0		; set disk arg
+	stx	DPTR
+	clr	LSN
+	clr	LSN+1
+	clr	LSN+2
+	;; Test for CCPT here !!!!
+	jsr	ccpttest
+	;; try to mount os9 filesystem
+	jsr	getlsn
+	;; print volume name
+	ldx	#str4
+	jsr	puts
+	ldx	#DBUF0+DD.NAM
+	jsr	putscr
+	;; get root dir's lsn
+	ldx	#DBUF0+DD.DIR
+	ldu	#root
+	jsr	cpy3
+	;; open boot file
+	ldx	#str0
+	jsr	puts
+	ldx	#BOOT
+	jsr	nopen
+	lbcs	fnferr
+	ldx	#dirbuf+$1d	; !!! replace with constant
+	ldu	#LSN		;
+	jsr	cpy3		; set LSN = lsn of dirent
+	jsr	open		; and open the file
+	ldd	fcounth		; check size 
+	lbne	toobig		; 
+	;; calculate start address
+	ldd	fcount		; save os9 size for passing to KRN
+	std	ksize		;
+	ldd	#$f000		; f000 - fcount = start address
+	subd	fcount		;
+	clrb			; and round it down
+	tfr	d,x		; X = cpu load address
+	cmpx	#$4000		; cant go lower
+	lblo	toobig
+	;; set mmu
+	lsra
+	lsra
+	lsra
+	lsra
+	lsra			; A = mmu bank no
+	ldy	#$ffa0
+	leay	a,y		; Y = beginning mmu
+	ldb	#1		; 1 is first os9 system block
+a@	stb	,y+		; store bank no in mmu
+	cmpy	#$ffa7		; did we move to the last mmu block
+	beq	b@		; yes, then quit looping
+	incb			; increment bank no
+	bra	a@		; repeat	
+	;; copy os9boot into memory
+b@	jsr	fload		; load os9boot into memory
+	jsr	putCR
+	;; open krn file
+	ldx	#str1
+	jsr	puts
+	ldx	#KRN
+	jsr	nopen
+	bcs	fnferr
+	ldx	#dirbuf+$1d	; !!! replace with constant
+	ldu	#LSN		;
+	jsr	cpy3		; set LSN = lsn of dirent
+	jsr	open		; and open the file
+	ldx	fcounth		; check size of krn file
+	lbne	krnsize		; is way too big
+	ldx	fcount		; 
+	cmpx	#$f00		;
+	lbne	krnsize		; wrong size
+	;; copy krn file into memory
+	ldx	#$f000
+	jsr	fload		; load ccbkrn into memory
+	jsr	putCR
+	;; clear out DP page
+	ldx	#0
+	clrb
+	jsr	memz
+	;; set dp
+	tfr	b,dp
+	;; set gime mirror
+	ldx	#$90
+	jsr	gime
+	;; jump to OS9
+	ldx	#str2
+	jsr	putscr
+	ldx	$f009		; KRN relative start address
+	leax	$f000,x		; make it absolute
+	ldu	#ksize		; U = ptr to os9boot size
+	orcc	#$50
+	jmp	,x		; jump to kernel (bye!)
+	
+iloop	bra	iloop
+
+	
+fnferr	ldx	#p0@
+	jsr	puts
+a@	bra	a@
+p0@	fcn	": FNF Error!"
+
+initerr	ldx	#p0@
+	jsr	puts
+a@	bra	a@
+p0@	fcn	"Driver Init Error!"
+
+mnterr	ldx	#p0@
+	jsr	puts
+a@	bra	a@
+p0@	fcn	"LSN0: bad format!"
+
+toobig	ldx	#p0@
+	jsr	puts
+a@	bra	a@
+p0@	fcn	"Too Big!"
+
+krnsize
+	ldx	#p0@
+	jsr	puts
+a@	bra	a@
+p0@	fcn	"Wrong Size!"
+	
+
+;;; Test for presence of CCPT partitioning
+ccpttest
+	pshs	d,x
+	ldd	DBUF0		; get magic
+	cmpd	#$4343		; check for "CC"
+	lbne	no@
+	ldd	DBUF0+2		; check for "PT"
+	cmpd	#$5054
+	lbne	no@		;
+no@	ldx	#p0@
+	jsr	putscr
+	puls	d,x,pc
+p0@	fcn	"CCPT not found."
+
+	
+;;; Setup Screen for os9 (sigh)
+scrSetup
+	pshs	d,x
+	;; set colors: green on black
+	ldb	#$12
+	stb	$ffbc
+	ldb	#0
+	stb	$ffbd
+	;; clear a screen's worth of video memory
+	ldb	#$3b
+	stb	$ffa0
+	ldx	#$0000
+	ldd	#$2020
+a@	std	,x++
+	cmpx	#$0400
+	bne	a@
+	;; set screen pointer up
+	ldd	#8
+	std	SCRPTR
+	clr	$ffa0
+	puls	d,x,pc
+
+	
+;;; Setup memory with gimme setting, aka Do os9's work :(
+;;;   takes: X = address
+;;;   returns: nothing
+;;;   modifies: nothing
+gime
+	pshs	d,x,u
+	ldu	#table@
+	lda	#16
+a@	ldb	,u+
+	stb	,x+
+	deca
+	bne	a@
+	puls	d,x,u,pc
+table@	.dw	$6c00
+	.dw	$0000
+	.dw	$0900
+	.dw	$0000
+	.dw	$0320
+	.dw	$0000
+	.db	$00
+	.dw	$ec01
+	.db	$00
+
+
+	
+;;; Read file into memory
+;;;   takes: X = address to load, file opened.
+;;;   modifies: nothing
+fload	pshs	b,x
+a@	jsr	readb
+	bcs	done@
+	stb	,x+
+	bra	a@
+done@	puls	b,x,pc
+
+
+	
+;;; open a file via a name
+;;;    takes: X = filename (zero termed)
+;;;    returns: dirbuf set to file's FD, C set on error.
+nopen
+	pshs	d,x,u
+	;; open root directory
+	ldx	#root
+	ldu	#LSN
+	jsr	cpy3
+	jsr	open
+	;; get a dirent into buffer
+	ldu	2,s		; U = filename
+b@	lda	#32
+	ldx	#dirbuf
+a@	jsr	readb
+	bcs	nfound@
+	stb	,x+
+	deca
+	bne	a@
+	jsr	os9toz
+	ldx	#dirbuf
+	jsr	strcmp
+	bcc	found@
+	bra	b@
+nfound@	coma
+	puls	d,x,u,pc
+found@	clra
+	puls	d,x,u,pc
+
+
+;;; zero mem
+;;;   takes: X = ptr, B = number of byte to zero
+;;;   returns: nothing
+;;;   modifies: nothing
+memz
+	pshs	b,x
+a@	clr	,x+
+	decb
+	bne	a@
+	puls	b,x,pc
+
+	
+
+;;; strcmp
+;;;   takes: X = zstring, U = zstring
+;;;   returns: C clear if equal
+strcmp
+	pshs	b,x,u
+a@	ldb	,x+
+	cmpb	,u+
+	bne	ne@		; not equal
+	tstb
+	beq	e@		; equal
+	bra	a@		; loop
+e@	clrb
+	puls	b,x,u,pc
+ne@	comb
+	puls	b,x,u,pc
+	
+;;; change dirbuf's name to a z-string
+os9toz
+	pshs	b,x
+	ldx	#dirbuf
+	tst	,x
+	beq	out@
+a@	ldb	,x+
+	bpl	a@
+	andb	#$7f
+	stb	-1,x
+	clr	,x
+out@	puls	b,x,pc
+	
+
+;;; Open file
+;;;   takes: LSN = lsn of file's FD
+;;;   returns: nothing
+open
+	pshs	d,x
+	ldx	#DBUF1		; load dbuf1 with file's FD
+	stx	DPTR
+	jsr	getlsn
+	ldd	#DBUF1+$10	; first segment
+	std	sptr		; save ptr
+	jsr	fill		; and get first sector
+	;; set fcount
+	ldd	DBUF1+FD.SIZ
+	std	fcounth
+	ldd	DBUF1+FD.SIZ+2
+	std	fcount
+	puls	d,x,pc
+
+;;; get one byte from file
+;;;   takes: nothing,
+;;;   returns: B = byte, C set on EOF
+readb
+	pshs	a,x
+	ldd	fcount		; is the entire file out of bytes?
+	beq	eof@
+	ldd	bcount
+	bne	a@		; if left don't refill
+	;; refill file's data buffer
+	jsr	fill
+	;; 
+a@	ldd	fcount
+	subd	#1
+	std	fcount
+	ldd	bcount
+	subd	#1
+	std	bcount
+	ldx	dptr
+	ldb	,x+
+	stx	dptr
+	clra
+	puls	a,x,pc
+eof@	coma
+	puls	a,x,pc
+	
+	
+fill
+	pshs	d,x,u		; save regs
+	jsr	spin1
+	ldx	sptr
+	ldd	3,x		; get sector count
+	bne	a@		; no more secs left in seg?
+	;; get next segment
+	ldx	sptr
+	leax	5,x
+	stx	sptr
+	;; fill buffer
+a@	ldx	sptr		; copy segment's LSN to args
+	ldu	#LSN		;
+	jsr	cpy3		;
+	ldx	#DBUF0		; set data buffer
+	stx	DPTR		;
+	jsr	getlsn		; and get the sector
+	;; increment segment
+	ldx	sptr		; increment segment's LSN
+	jsr	inc3		; 
+	ldd	3,x		; decrement segment's sector count
+	subd	#1		;
+	std	3,x		;
+	;; set file dirs
+	ldd	#256
+	std	bcount
+	ldd	#DBUF0
+	std	dptr
+	puls	d,x,u,pc	; return
+	
+
+;;; Spin the ticker
+;;;   takes: nothing
+;;;   returns: nothing
+;;;   modifies: nothing
+spin1
+	pshs	b
+	ldb	#'.
+	jsr	putc
+	puls	b,pc
+
+	
+;;; Copy 3 bytes value
+;;;   take: X = src ptr, U = dst ptr
+;;;   modifies: nothing
+cpy3
+	pshs	d,x,u
+	ldd	,x++
+	std	,u++
+	ldb	,x
+	stb	,u
+	puls	d,x,u,pc
+
+
+;;; increment 3 byte value by one
+;;;  takes: X = ptr to 3 bytes
+;;;  returns: nothing
+inc3
+	pshs	d,x
+	ldd	1,x
+	addd	#1
+	std	1,x
+	ldb	,x
+	adcb	#0
+	stb	,x
+	puls	d,x,pc
+	
+
+;;; deblocker to translate 256B LSN to a 512B LSN
+;;;   takes: args in LSN/DPTR
+;;;   modifies: nothing
+getlsn
+	pshs	b,x
+	ldx	#LSN		; get pointer
+	lsr 	,x+
+	ror	,x+
+	ror	,x+
+	ldb	#1		; 256b lower read
+	bcc	a@
+	negb
+a@	stb	SMALL
+	jsr	ll_read
+	puls	b,x,pc
+	
+
+
+;;; Dump 128 byte to screen
+;;;   takes: X = ptr to data
+;;;   modifies: nothing
+dump
+	pshs	d,x
+	jsr	putCR
+	lda	#8
+	pshs	a		; put row counter
+b@	lda	#8		; column counter
+	pshs	x
+a@	ldb	,x+
+	jsr	putb
+	jsr	putSP
+	deca
+	bne	a@
+	puls	x
+	clr	8,x
+	jsr	putscr
+	dec	,s
+	bne	b@
+	leas	1,s
+	puls	d,x,pc
+
+;;; Print a Space
+putSP
+	pshs	b
+	ldb	#SP
+	jsr	putc
+	puls	b,pc
+
+	
+;;; Print a CR
+putCR
+	pshs	d
+	ldb	#$3b
+	stb	$ffa0
+	ldd	SCRPTR
+	addd	#32-8
+	andb	#~$1f
+	addd	#8
+	std	SCRPTR
+	clr	$ffa0
+	puls	d,pc
+
+
+;;; Print a Z string
+;;;   takes: X = ptr to string
+;;;   modifies: nothing
+puts
+	pshs	b,x
+a@	ldb	,x+
+	beq	done@
+	jsr	putc
+	bra	a@
+done@	puls	b,x,pc	
+	
+;;; Print a 3 byte value ( in hex )
+;;;   takes: X = ptr to value
+;;;   modifies: nothing
+put3
+	pshs	d,x
+	ldd	,x++
+	jsr	putw
+	ldb	,x
+	jsr	putb
+	puls	d,x,pc
+	
+
+;;; Print a word ( in hex)
+;;;   takes: D = word
+;;;   modifies: nothing
+putw
+	pshs	b
+	tfr	a,b
+	bsr	putb
+	puls	b
+	bsr	putb
+	rts
+	
+;;; Print a byte (in hex)
+;;;   takes: B = byte
+;;;   modifies: nothing
+putb
+	pshs	d
+	lsrb
+	lsrb
+	lsrb
+	lsrb
+	bsr	putn
+	ldb	1,s
+	bsr	putn
+	puls	d,pc
+
+;;; Print a Char
+;;;   takes: B = charactor
+;;;   modifies: nothing
+putc
+	pshs	d,x
+	lda	#$3b		; put 3b in bank 0
+	sta	$ffa0
+	ldx	SCRPTR
+	stb	,x+
+	stx	SCRPTR
+	clr	$ffa0		; put 0 in bank 0
+	puls	d,x,pc
+	
+	
+;;; Print a nibble
+;;;   takes: B = nibble
+;;;   modifies: nothing
+putn
+	pshs	b
+	andb	#$f
+	addb	#$30
+	cmpb	#$39
+	bls	a@
+	addb	#7
+a@	jsr	putc
+	puls	b,pc
+	
+
+;;; Print a string followed by a CR
+;;;   takes: X = zero termed string
+;;;   returns: nothing
+;;;   modifies: nothing
+putscr
+	jsr	puts
+	jsr	putCR
+	rts
+	
+
+	
+	include	"sd.asm"
+
+ende	equ 	*
+
+
+	end	prestart
\ No newline at end of file

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/3rdparty/utils/fpgarom/test.lnk	Sat Feb 04 18:54:49 2017 +0100
@@ -0,0 +1,6 @@
+define basesympat start%s
+define lensympat  length%s
+section	.bss  load  1000
+section bounce
+section .code load  2000
+entry	prestart
\ No newline at end of file

--- a/3rdparty/utils/makefile	Sat Feb 04 18:33:07 2017 +0100
+++ b/3rdparty/utils/makefile	Sat Feb 04 18:54:49 2017 +0100
@@ -1,6 +1,6 @@
 include ../../rules.mak
 
-dirs	= boisy dasm smartwatch supercomm dladd winfo gene tlindner
+dirs	= boisy dasm smartwatch supercomm dladd winfo gene tlindner fpgarom
 
 # Make all components
 all: