firmware/ice40-riscv: Import common parts to all iCE40/RISC-V firmwares
Signed-off-by: Sylvain Munaut <tnt@246tNt.com>
This commit is contained in:
parent
546493e606
commit
26bc4659af
|
@ -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>.
|
|
@ -0,0 +1,165 @@
|
|||
GNU LESSER 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.
|
||||
|
||||
|
||||
This version of the GNU Lesser General Public License incorporates
|
||||
the terms and conditions of version 3 of the GNU General Public
|
||||
License, supplemented by the additional permissions listed below.
|
||||
|
||||
0. Additional Definitions.
|
||||
|
||||
As used herein, "this License" refers to version 3 of the GNU Lesser
|
||||
General Public License, and the "GNU GPL" refers to version 3 of the GNU
|
||||
General Public License.
|
||||
|
||||
"The Library" refers to a covered work governed by this License,
|
||||
other than an Application or a Combined Work as defined below.
|
||||
|
||||
An "Application" is any work that makes use of an interface provided
|
||||
by the Library, but which is not otherwise based on the Library.
|
||||
Defining a subclass of a class defined by the Library is deemed a mode
|
||||
of using an interface provided by the Library.
|
||||
|
||||
A "Combined Work" is a work produced by combining or linking an
|
||||
Application with the Library. The particular version of the Library
|
||||
with which the Combined Work was made is also called the "Linked
|
||||
Version".
|
||||
|
||||
The "Minimal Corresponding Source" for a Combined Work means the
|
||||
Corresponding Source for the Combined Work, excluding any source code
|
||||
for portions of the Combined Work that, considered in isolation, are
|
||||
based on the Application, and not on the Linked Version.
|
||||
|
||||
The "Corresponding Application Code" for a Combined Work means the
|
||||
object code and/or source code for the Application, including any data
|
||||
and utility programs needed for reproducing the Combined Work from the
|
||||
Application, but excluding the System Libraries of the Combined Work.
|
||||
|
||||
1. Exception to Section 3 of the GNU GPL.
|
||||
|
||||
You may convey a covered work under sections 3 and 4 of this License
|
||||
without being bound by section 3 of the GNU GPL.
|
||||
|
||||
2. Conveying Modified Versions.
|
||||
|
||||
If you modify a copy of the Library, and, in your modifications, a
|
||||
facility refers to a function or data to be supplied by an Application
|
||||
that uses the facility (other than as an argument passed when the
|
||||
facility is invoked), then you may convey a copy of the modified
|
||||
version:
|
||||
|
||||
a) under this License, provided that you make a good faith effort to
|
||||
ensure that, in the event an Application does not supply the
|
||||
function or data, the facility still operates, and performs
|
||||
whatever part of its purpose remains meaningful, or
|
||||
|
||||
b) under the GNU GPL, with none of the additional permissions of
|
||||
this License applicable to that copy.
|
||||
|
||||
3. Object Code Incorporating Material from Library Header Files.
|
||||
|
||||
The object code form of an Application may incorporate material from
|
||||
a header file that is part of the Library. You may convey such object
|
||||
code under terms of your choice, provided that, if the incorporated
|
||||
material is not limited to numerical parameters, data structure
|
||||
layouts and accessors, or small macros, inline functions and templates
|
||||
(ten or fewer lines in length), you do both of the following:
|
||||
|
||||
a) Give prominent notice with each copy of the object code that the
|
||||
Library is used in it and that the Library and its use are
|
||||
covered by this License.
|
||||
|
||||
b) Accompany the object code with a copy of the GNU GPL and this license
|
||||
document.
|
||||
|
||||
4. Combined Works.
|
||||
|
||||
You may convey a Combined Work under terms of your choice that,
|
||||
taken together, effectively do not restrict modification of the
|
||||
portions of the Library contained in the Combined Work and reverse
|
||||
engineering for debugging such modifications, if you also do each of
|
||||
the following:
|
||||
|
||||
a) Give prominent notice with each copy of the Combined Work that
|
||||
the Library is used in it and that the Library and its use are
|
||||
covered by this License.
|
||||
|
||||
b) Accompany the Combined Work with a copy of the GNU GPL and this license
|
||||
document.
|
||||
|
||||
c) For a Combined Work that displays copyright notices during
|
||||
execution, include the copyright notice for the Library among
|
||||
these notices, as well as a reference directing the user to the
|
||||
copies of the GNU GPL and this license document.
|
||||
|
||||
d) Do one of the following:
|
||||
|
||||
0) Convey the Minimal Corresponding Source under the terms of this
|
||||
License, and the Corresponding Application Code in a form
|
||||
suitable for, and under terms that permit, the user to
|
||||
recombine or relink the Application with a modified version of
|
||||
the Linked Version to produce a modified Combined Work, in the
|
||||
manner specified by section 6 of the GNU GPL for conveying
|
||||
Corresponding Source.
|
||||
|
||||
1) Use a suitable shared library mechanism for linking with the
|
||||
Library. A suitable mechanism is one that (a) uses at run time
|
||||
a copy of the Library already present on the user's computer
|
||||
system, and (b) will operate properly with a modified version
|
||||
of the Library that is interface-compatible with the Linked
|
||||
Version.
|
||||
|
||||
e) Provide Installation Information, but only if you would otherwise
|
||||
be required to provide such information under section 6 of the
|
||||
GNU GPL, and only to the extent that such information is
|
||||
necessary to install and execute a modified version of the
|
||||
Combined Work produced by recombining or relinking the
|
||||
Application with a modified version of the Linked Version. (If
|
||||
you use option 4d0, the Installation Information must accompany
|
||||
the Minimal Corresponding Source and Corresponding Application
|
||||
Code. If you use option 4d1, you must provide the Installation
|
||||
Information in the manner specified by section 6 of the GNU GPL
|
||||
for conveying Corresponding Source.)
|
||||
|
||||
5. Combined Libraries.
|
||||
|
||||
You may place library facilities that are a work based on the
|
||||
Library side by side in a single library together with other library
|
||||
facilities that are not Applications and are not covered by this
|
||||
License, and convey such a combined library under terms of your
|
||||
choice, if you do both of the following:
|
||||
|
||||
a) Accompany the combined library with a copy of the same work based
|
||||
on the Library, uncombined with any other library facilities,
|
||||
conveyed under the terms of this License.
|
||||
|
||||
b) Give prominent notice with the combined library that part of it
|
||||
is a work based on the Library, and explaining where to find the
|
||||
accompanying uncombined form of the same work.
|
||||
|
||||
6. Revised Versions of the GNU Lesser General Public License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions
|
||||
of the GNU Lesser 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
|
||||
Library as you received it specifies that a certain numbered version
|
||||
of the GNU Lesser General Public License "or any later version"
|
||||
applies to it, you have the option of following the terms and
|
||||
conditions either of that published version or of any later version
|
||||
published by the Free Software Foundation. If the Library as you
|
||||
received it does not specify a version number of the GNU Lesser
|
||||
General Public License, you may choose any version of the GNU Lesser
|
||||
General Public License ever published by the Free Software Foundation.
|
||||
|
||||
If the Library as you received it specifies that a proxy can decide
|
||||
whether future versions of the GNU Lesser General Public License shall
|
||||
apply, that proxy's public statement of acceptance of any version is
|
||||
permanent authorization for you to choose that version for the
|
||||
Library.
|
|
@ -0,0 +1,15 @@
|
|||
Firmware for iCE40 based board
|
||||
==============================
|
||||
|
||||
The icE1usb, icE1usb-proto and e1-tracer boards are running very similar
|
||||
gateware, all based around a PicoRV32 RISC-V softcore supported by custom
|
||||
hardware cores to deal with USB and E1.
|
||||
|
||||
|
||||
License
|
||||
-------
|
||||
|
||||
Files in here are licended either under GPLv3 or LGPLv3 depending on the
|
||||
specific file. Refer to the notice at the top of each file.
|
||||
|
||||
Full text for both licenses is included next to this README.
|
|
@ -0,0 +1,22 @@
|
|||
#!/usr/bin/env python3
|
||||
#
|
||||
# Converts binary into something that can be used by `readmemh`
|
||||
#
|
||||
# Copyright (C) 2020 Sylvain Munaut <tnt@246tNt.com>
|
||||
# SPDX-License-Identifier: MIT
|
||||
#
|
||||
|
||||
import struct
|
||||
import sys
|
||||
|
||||
|
||||
def main(argv0, in_name, out_name):
|
||||
with open(in_name, 'rb') as in_fh, open(out_name, 'w') as out_fh:
|
||||
while True:
|
||||
b = in_fh.read(4)
|
||||
if len(b) < 4:
|
||||
break
|
||||
out_fh.write('%08x\n' % struct.unpack('<I', b))
|
||||
|
||||
if __name__ == '__main__':
|
||||
main(*sys.argv)
|
|
@ -0,0 +1,76 @@
|
|||
/*
|
||||
* console.c
|
||||
*
|
||||
* Copyright (C) 2019-2020 Sylvain Munaut <tnt@246tNt.com>
|
||||
* SPDX-License-Identifier: LGPL-3.0-or-later
|
||||
*/
|
||||
|
||||
#include <stdint.h>
|
||||
|
||||
#include "config.h"
|
||||
#include "mini-printf.h"
|
||||
|
||||
|
||||
struct wb_uart {
|
||||
uint32_t data;
|
||||
uint32_t clkdiv;
|
||||
} __attribute__((packed,aligned(4)));
|
||||
|
||||
static volatile struct wb_uart * const uart_regs = (void*)(UART_BASE);
|
||||
|
||||
|
||||
static char _printf_buf[128];
|
||||
|
||||
void console_init(void)
|
||||
{
|
||||
#ifdef BOARD_E1_TRACER
|
||||
uart_regs->clkdiv = 22; /* ~1 Mbaud with clk=24MHz */
|
||||
#else
|
||||
uart_regs->clkdiv = 29; /* ~1 Mbaud with clk=30.72MHz */
|
||||
#endif
|
||||
}
|
||||
|
||||
char getchar(void)
|
||||
{
|
||||
int32_t c;
|
||||
do {
|
||||
c = uart_regs->data;
|
||||
} while (c & 0x80000000);
|
||||
return c;
|
||||
}
|
||||
|
||||
int getchar_nowait(void)
|
||||
{
|
||||
int32_t c;
|
||||
c = uart_regs->data;
|
||||
return c & 0x80000000 ? -1 : (c & 0xff);
|
||||
}
|
||||
|
||||
void putchar(char c)
|
||||
{
|
||||
uart_regs->data = c;
|
||||
}
|
||||
|
||||
void puts(const char *p)
|
||||
{
|
||||
char c;
|
||||
while ((c = *(p++)) != 0x00) {
|
||||
if (c == '\n')
|
||||
uart_regs->data = '\r';
|
||||
uart_regs->data = c;
|
||||
}
|
||||
}
|
||||
|
||||
int printf(const char *fmt, ...)
|
||||
{
|
||||
va_list va;
|
||||
int l;
|
||||
|
||||
va_start(va, fmt);
|
||||
l = mini_vsnprintf(_printf_buf, 128, fmt, va);
|
||||
va_end(va);
|
||||
|
||||
puts(_printf_buf);
|
||||
|
||||
return l;
|
||||
}
|
|
@ -0,0 +1,16 @@
|
|||
/*
|
||||
* console.h
|
||||
*
|
||||
* Copyright (C) 2019-2020 Sylvain Munaut <tnt@246tNt.com>
|
||||
* SPDX-License-Identifier: LGPL-3.0-or-later
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
void console_init(void);
|
||||
|
||||
char getchar(void);
|
||||
int getchar_nowait(void);
|
||||
void putchar(char c);
|
||||
void puts(const char *p);
|
||||
int printf(const char *fmt, ...);
|
|
@ -0,0 +1,69 @@
|
|||
/*
|
||||
* dma.c
|
||||
*
|
||||
* Copyright (C) 2019-2020 Sylvain Munaut <tnt@246tNt.com>
|
||||
* SPDX-License-Identifier: GPL-3.0-or-later
|
||||
*/
|
||||
|
||||
#include <stdbool.h>
|
||||
#include <stdint.h>
|
||||
|
||||
#include "config.h"
|
||||
#include "dma.h"
|
||||
|
||||
|
||||
struct dma {
|
||||
uint32_t csr;
|
||||
uint32_t _rsvd;
|
||||
uint32_t addr_e1;
|
||||
uint32_t addr_usb;
|
||||
} __attribute__((packed,aligned(4)));
|
||||
|
||||
#define DMA_CSR_GO (1 << 15)
|
||||
#define DMA_CSR_BUSY (1 << 15)
|
||||
#define DMA_DIR_E1_TO_USB (0 << 14)
|
||||
#define DMA_DIR_USB_TO_E1 (1 << 14)
|
||||
#define DMA_CSR_LEN(x) (((x)-2) & 0x1fff)
|
||||
|
||||
static volatile struct dma * const dma_regs = (void*)(DMA_BASE);
|
||||
|
||||
static struct {
|
||||
bool pending;
|
||||
dma_cb cb_fn;
|
||||
void *cb_data;
|
||||
} g_dma;
|
||||
|
||||
|
||||
bool
|
||||
dma_ready(void)
|
||||
{
|
||||
return !(dma_regs->csr & DMA_CSR_BUSY);
|
||||
}
|
||||
|
||||
void
|
||||
dma_exec(unsigned addr_e1, unsigned addr_usb, unsigned len, bool dir,
|
||||
dma_cb cb_fn, void *cb_data)
|
||||
{
|
||||
dma_regs->addr_e1 = addr_e1;
|
||||
dma_regs->addr_usb = addr_usb;
|
||||
dma_regs->csr =
|
||||
DMA_CSR_GO |
|
||||
(dir ? DMA_DIR_USB_TO_E1 : DMA_DIR_E1_TO_USB) |
|
||||
DMA_CSR_LEN(len);
|
||||
|
||||
g_dma.pending = true;
|
||||
g_dma.cb_fn = cb_fn;
|
||||
g_dma.cb_data = cb_data;
|
||||
}
|
||||
|
||||
bool
|
||||
dma_poll(void)
|
||||
{
|
||||
if (g_dma.pending && dma_ready()) {
|
||||
g_dma.pending = false;
|
||||
if (g_dma.cb_fn)
|
||||
g_dma.cb_fn(g_dma.cb_data);
|
||||
}
|
||||
|
||||
return g_dma.pending;
|
||||
}
|
|
@ -0,0 +1,23 @@
|
|||
/*
|
||||
* dma.h
|
||||
*
|
||||
* Copyright (C) 2019-2020 Sylvain Munaut <tnt@246tNt.com>
|
||||
* SPDX-License-Identifier: GPL-3.0-or-later
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <stdbool.h>
|
||||
|
||||
typedef void (*dma_cb)(void *);
|
||||
|
||||
/* Direction
|
||||
* 0 is E1 to USB
|
||||
* 1 is USB to E1
|
||||
*/
|
||||
|
||||
bool dma_ready(void);
|
||||
void dma_exec(unsigned addr_e1, unsigned addr_usb, unsigned len, bool dir,
|
||||
dma_cb cb_fn, void *cb_data);
|
||||
|
||||
bool dma_poll(void);
|
|
@ -0,0 +1,167 @@
|
|||
/*
|
||||
* led.c
|
||||
*
|
||||
* Copyright (C) 2019-2020 Sylvain Munaut <tnt@246tNt.com>
|
||||
* SPDX-License-Identifier: LGPL-3.0-or-later
|
||||
*/
|
||||
|
||||
#include <stdbool.h>
|
||||
#include <stdint.h>
|
||||
|
||||
#include "config.h"
|
||||
#include "led.h"
|
||||
|
||||
|
||||
struct ledda_ip {
|
||||
uint32_t _rsvd0;
|
||||
uint32_t pwrr; /* 0001 LEDDPWRR - Pulse Width Register Red */
|
||||
uint32_t pwrg; /* 0010 LEDDPWRG - Pulse Width Register Green */
|
||||
uint32_t pwrb; /* 0011 LEDDPWRB - Pulse Width Register Blue */
|
||||
uint32_t _rsvd1;
|
||||
uint32_t bcrr; /* 0101 LEDDBCRR - Breathe Control Rise Register */
|
||||
uint32_t bcfr; /* 0101 LEDDBCFR - Breathe Control Fall Register */
|
||||
uint32_t _rsvd2;
|
||||
uint32_t cr0; /* 1000 LEDDCR0 - Control Register 0 */
|
||||
uint32_t br; /* 1001 LEDDBR - Pre-scale Register */
|
||||
uint32_t onr; /* 1010 LEDONR - ON Time Register */
|
||||
uint32_t ofr; /* 1011 LEDOFR - OFF Time Register */
|
||||
} __attribute__((packed,aligned(4)));
|
||||
|
||||
#define LEDDA_IP_CR0_LEDDEN (1 << 7)
|
||||
#define LEDDA_IP_CR0_FR250 (1 << 6)
|
||||
#define LEDDA_IP_CR0_OUTPOL (1 << 5)
|
||||
#define LEDDA_IP_CR0_OUTSKEW (1 << 4)
|
||||
#define LEDDA_IP_CR0_QUICK_STOP (1 << 3)
|
||||
#define LEDDA_IP_CR0_PWM_LINEAR (0 << 2)
|
||||
#define LEDDA_IP_CR0_PWM_LFSR (1 << 2)
|
||||
#define LEDDA_IP_CR0_SCALE_MSB(x) (((x) >> 8) & 3)
|
||||
|
||||
#define LEDDA_IP_BR_SCALE_LSB(x) ((x) & 0xff)
|
||||
|
||||
#define LEDDA_IP_ONOFF_TIME_MS(x) (((x) >> 5) & 0xff) /* 32ms interval up to 8s */
|
||||
|
||||
#define LEDDA_IP_BREATHE_ENABLE (1 << 7)
|
||||
#define LEDDA_IP_BREATHE_MODULATE (1 << 5)
|
||||
#define LEDDA_IP_BREATHE_TIME_MS(x) (((x) >> 7) & 0x0f) /* 128ms interval up to 2s */
|
||||
|
||||
|
||||
struct led {
|
||||
uint32_t csr;
|
||||
uint32_t _rsvd[15];
|
||||
struct ledda_ip ip;
|
||||
} __attribute__((packed,aligned(4)));
|
||||
|
||||
#define LED_CSR_LEDDEXE (1 << 1)
|
||||
#define LED_CSR_RGBLEDEN (1 << 2)
|
||||
#define LED_CSR_CURREN (1 << 3)
|
||||
|
||||
|
||||
static volatile struct led * const led_regs = (void*)(LED_BASE);
|
||||
|
||||
static const uint32_t led_cr0_base =
|
||||
LEDDA_IP_CR0_FR250 |
|
||||
LEDDA_IP_CR0_OUTSKEW |
|
||||
LEDDA_IP_CR0_QUICK_STOP |
|
||||
LEDDA_IP_CR0_PWM_LFSR |
|
||||
LEDDA_IP_CR0_SCALE_MSB(480);
|
||||
|
||||
|
||||
void
|
||||
led_init(void)
|
||||
{
|
||||
led_regs->ip.pwrr = 0;
|
||||
led_regs->ip.pwrg = 0;
|
||||
led_regs->ip.pwrb = 0;
|
||||
|
||||
led_regs->ip.bcrr = 0;
|
||||
led_regs->ip.bcfr = 0;
|
||||
|
||||
led_regs->ip.onr = 0;
|
||||
led_regs->ip.ofr = 0;
|
||||
|
||||
led_regs->ip.br = LEDDA_IP_BR_SCALE_LSB(480);
|
||||
led_regs->ip.cr0 = led_cr0_base;
|
||||
|
||||
led_regs->csr = LED_CSR_LEDDEXE | LED_CSR_RGBLEDEN | LED_CSR_CURREN;
|
||||
}
|
||||
|
||||
void
|
||||
led_color(uint8_t r, uint8_t g, uint8_t b)
|
||||
{
|
||||
#if defined(BOARD_ICE1USB)
|
||||
// icE1usb
|
||||
led_regs->ip.pwrr = b;
|
||||
led_regs->ip.pwrg = g;
|
||||
led_regs->ip.pwrb = r;
|
||||
#elif defined(BOARD_ICE1USB_PROTO_ICEBREAKER)
|
||||
// iCEBreaker v1.0b tnt
|
||||
led_regs->ip.pwrr = r;
|
||||
led_regs->ip.pwrg = b;
|
||||
led_regs->ip.pwrb = g;
|
||||
/*
|
||||
// iCEBreaker v1.0c+
|
||||
led_regs->ip.pwrr = b;
|
||||
led_regs->ip.pwrg = g;
|
||||
led_regs->ip.pwrb = r;
|
||||
*/
|
||||
#elif defined(BOARD_ICE1USB_PROTO_BITSY)
|
||||
// iCEBreaker bitsy v0 (RGB led 'hacked on')
|
||||
led_regs->ip.pwrr = g;
|
||||
led_regs->ip.pwrg = r;
|
||||
led_regs->ip.pwrb = b;
|
||||
#elif defined(BOARD_E1_TRACER)
|
||||
// E1 tracer
|
||||
led_regs->ip.pwrr = b;
|
||||
led_regs->ip.pwrg = g;
|
||||
led_regs->ip.pwrb = r;
|
||||
#else
|
||||
// Default / Unknown
|
||||
led_regs->ip.pwrr = r;
|
||||
led_regs->ip.pwrg = g;
|
||||
led_regs->ip.pwrb = b;
|
||||
#endif
|
||||
}
|
||||
|
||||
void
|
||||
led_state(bool on)
|
||||
{
|
||||
if (on)
|
||||
led_regs->ip.cr0 = led_cr0_base | LEDDA_IP_CR0_LEDDEN;
|
||||
else
|
||||
led_regs->ip.cr0 = led_cr0_base;
|
||||
}
|
||||
|
||||
void
|
||||
led_blink(bool enabled, int on_time_ms, int off_time_ms)
|
||||
{
|
||||
/* Disable EXE before doing any change */
|
||||
led_regs->csr = LED_CSR_RGBLEDEN | LED_CSR_CURREN;
|
||||
|
||||
/* Load new config */
|
||||
if (enabled) {
|
||||
led_regs->ip.onr = LEDDA_IP_ONOFF_TIME_MS(on_time_ms);
|
||||
led_regs->ip.ofr = LEDDA_IP_ONOFF_TIME_MS(off_time_ms);
|
||||
} else {
|
||||
led_regs->ip.onr = 0;
|
||||
led_regs->ip.ofr = 0;
|
||||
}
|
||||
|
||||
/* Re-enable execution */
|
||||
led_regs->csr = LED_CSR_LEDDEXE | LED_CSR_RGBLEDEN | LED_CSR_CURREN;
|
||||
}
|
||||
|
||||
void
|
||||
led_breathe(bool enabled, int rise_time_ms, int fall_time_ms)
|
||||
{
|
||||
if (enabled) {
|
||||
led_regs->ip.bcrr = LEDDA_IP_BREATHE_ENABLE |
|
||||
LEDDA_IP_BREATHE_MODULATE |
|
||||
LEDDA_IP_BREATHE_TIME_MS(rise_time_ms);
|
||||
led_regs->ip.bcfr = LEDDA_IP_BREATHE_ENABLE |
|
||||
LEDDA_IP_BREATHE_MODULATE |
|
||||
LEDDA_IP_BREATHE_TIME_MS(fall_time_ms);
|
||||
} else {
|
||||
led_regs->ip.bcrr = 0;
|
||||
led_regs->ip.bcfr = 0;
|
||||
}
|
||||
}
|
|
@ -0,0 +1,16 @@
|
|||
/*
|
||||
* led.h
|
||||
*
|
||||
* Copyright (C) 2019-2020 Sylvain Munaut <tnt@246tNt.com>
|
||||
* SPDX-License-Identifier: LGPL-3.0-or-later
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <stdbool.h>
|
||||
|
||||
void led_init(void);
|
||||
void led_color(uint8_t r, uint8_t g, uint8_t b);
|
||||
void led_state(bool on);
|
||||
void led_blink(bool enabled, int on_time_ms, int off_time_ms);
|
||||
void led_breathe(bool enabled, int rise_time_ms, int fall_time_ms);
|
|
@ -0,0 +1,52 @@
|
|||
MEMORY
|
||||
{
|
||||
SPRAM (xrw) : ORIGIN = 0x00020000, LENGTH = 0x10000
|
||||
BRAM (xrw) : ORIGIN = 0x00000010, LENGTH = 0x03f0
|
||||
}
|
||||
ENTRY(_start)
|
||||
SECTIONS {
|
||||
.text :
|
||||
{
|
||||
. = ALIGN(4);
|
||||
*(.text.start)
|
||||
*(.text)
|
||||
*(.text*)
|
||||
*(.rodata)
|
||||
*(.rodata*)
|
||||
*(.srodata)
|
||||
*(.srodata*)
|
||||
. = ALIGN(4);
|
||||
_etext = .;
|
||||
_sidata = _etext;
|
||||
} >SPRAM
|
||||
.data : AT ( _sidata )
|
||||
{
|
||||
. = ALIGN(4);
|
||||
_sdata = .;
|
||||
_ram_start = .;
|
||||
. = ALIGN(4);
|
||||
*(.data)
|
||||
*(.data*)
|
||||
*(.sdata)
|
||||
*(.sdata*)
|
||||
. = ALIGN(4);
|
||||
_edata = .;
|
||||
} >SPRAM
|
||||
.bss :
|
||||
{
|
||||
. = ALIGN(4);
|
||||
_sbss = .;
|
||||
*(.bss)
|
||||
*(.bss*)
|
||||
*(.sbss)
|
||||
*(.sbss*)
|
||||
*(COMMON)
|
||||
. = ALIGN(4);
|
||||
_ebss = .;
|
||||
} >SPRAM
|
||||
.heap :
|
||||
{
|
||||
. = ALIGN(4);
|
||||
_heap_start = .;
|
||||
} >SPRAM
|
||||
}
|
|
@ -0,0 +1,208 @@
|
|||
/*
|
||||
* The Minimal snprintf() implementation
|
||||
*
|
||||
* Copyright (c) 2013,2014 Michal Ludvig <michal@logix.cz>
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions are met:
|
||||
* * Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* * Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* * Neither the name of the auhor nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
||||
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
|
||||
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
||||
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
||||
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
||||
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
||||
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*
|
||||
* ----
|
||||
*
|
||||
* This is a minimal snprintf() implementation optimised
|
||||
* for embedded systems with a very limited program memory.
|
||||
* mini_snprintf() doesn't support _all_ the formatting
|
||||
* the glibc does but on the other hand is a lot smaller.
|
||||
* Here are some numbers from my STM32 project (.bin file size):
|
||||
* no snprintf(): 10768 bytes
|
||||
* mini snprintf(): 11420 bytes (+ 652 bytes)
|
||||
* glibc snprintf(): 34860 bytes (+24092 bytes)
|
||||
* Wasting nearly 24kB of memory just for snprintf() on
|
||||
* a chip with 32kB flash is crazy. Use mini_snprintf() instead.
|
||||
*
|
||||
*/
|
||||
|
||||
#include "mini-printf.h"
|
||||
|
||||
static unsigned int
|
||||
mini_strlen(const char *s)
|
||||
{
|
||||
unsigned int len = 0;
|
||||
while (s[len] != '\0') len++;
|
||||
return len;
|
||||
}
|
||||
|
||||
static unsigned int
|
||||
mini_itoa(int value, unsigned int radix, unsigned int uppercase, unsigned int unsig,
|
||||
char *buffer, unsigned int zero_pad)
|
||||
{
|
||||
char *pbuffer = buffer;
|
||||
int negative = 0;
|
||||
unsigned int i, len;
|
||||
|
||||
/* No support for unusual radixes. */
|
||||
if (radix > 16)
|
||||
return 0;
|
||||
|
||||
if (value < 0 && !unsig) {
|
||||
negative = 1;
|
||||
value = -value;
|
||||
}
|
||||
|
||||
/* This builds the string back to front ... */
|
||||
do {
|
||||
int digit = value % radix;
|
||||
*(pbuffer++) = (digit < 10 ? '0' + digit : (uppercase ? 'A' : 'a') + digit - 10);
|
||||
value /= radix;
|
||||
} while (value > 0);
|
||||
|
||||
for (i = (pbuffer - buffer); i < zero_pad; i++)
|
||||
*(pbuffer++) = '0';
|
||||
|
||||
if (negative)
|
||||
*(pbuffer++) = '-';
|
||||
|
||||
*(pbuffer) = '\0';
|
||||
|
||||
/* ... now we reverse it (could do it recursively but will
|
||||
* conserve the stack space) */
|
||||
len = (pbuffer - buffer);
|
||||
for (i = 0; i < len / 2; i++) {
|
||||
char j = buffer[i];
|
||||
buffer[i] = buffer[len-i-1];
|
||||
buffer[len-i-1] = j;
|
||||
}
|
||||
|
||||
return len;
|
||||
}
|
||||
|
||||
struct mini_buff {
|
||||
char *buffer, *pbuffer;
|
||||
unsigned int buffer_len;
|
||||
};
|
||||
|
||||
static int
|
||||
_putc(int ch, struct mini_buff *b)
|
||||
{
|
||||
if ((unsigned int)((b->pbuffer - b->buffer) + 1) >= b->buffer_len)
|
||||
return 0;
|
||||
*(b->pbuffer++) = ch;
|
||||
*(b->pbuffer) = '\0';
|
||||
return 1;
|
||||
}
|
||||
|
||||
static int
|
||||
_puts(char *s, unsigned int len, struct mini_buff *b)
|
||||
{
|
||||
unsigned int i;
|
||||
|
||||
if (b->buffer_len - (b->pbuffer - b->buffer) - 1 < len)
|
||||
len = b->buffer_len - (b->pbuffer - b->buffer) - 1;
|
||||
|
||||
/* Copy to buffer */
|
||||
for (i = 0; i < len; i++)
|
||||
*(b->pbuffer++) = s[i];
|
||||
*(b->pbuffer) = '\0';
|
||||
|
||||
return len;
|
||||
}
|
||||
|
||||
int
|
||||
mini_vsnprintf(char *buffer, unsigned int buffer_len, const char *fmt, va_list va)
|
||||
{
|
||||
struct mini_buff b;
|
||||
char bf[24];
|
||||
char ch;
|
||||
|
||||
b.buffer = buffer;
|
||||
b.pbuffer = buffer;
|
||||
b.buffer_len = buffer_len;
|
||||
|
||||
while ((ch=*(fmt++))) {
|
||||
if ((unsigned int)((b.pbuffer - b.buffer) + 1) >= b.buffer_len)
|
||||
break;
|
||||
if (ch!='%')
|
||||
_putc(ch, &b);
|
||||
else {
|
||||
char zero_pad = 0;
|
||||
char *ptr;
|
||||
unsigned int len;
|
||||
|
||||
ch=*(fmt++);
|
||||
|
||||
/* Zero padding requested */
|
||||
if (ch=='0') {
|
||||
ch=*(fmt++);
|
||||
if (ch == '\0')
|
||||
goto end;
|
||||
if (ch >= '0' && ch <= '9')
|
||||
zero_pad = ch - '0';
|
||||
ch=*(fmt++);
|
||||
}
|
||||
|
||||
switch (ch) {
|
||||
case 0:
|
||||
goto end;
|
||||
|
||||
case 'u':
|
||||
case 'd':
|
||||
len = mini_itoa(va_arg(va, unsigned int), 10, 0, (ch=='u'), bf, zero_pad);
|
||||
_puts(bf, len, &b);
|
||||
break;
|
||||
|
||||
case 'x':
|
||||
case 'X':
|
||||
len = mini_itoa(va_arg(va, unsigned int), 16, (ch=='X'), 1, bf, zero_pad);
|
||||
_puts(bf, len, &b);
|
||||
break;
|
||||
|
||||
case 'c' :
|
||||
_putc((char)(va_arg(va, int)), &b);
|
||||
break;
|
||||
|
||||
case 's' :
|
||||
ptr = va_arg(va, char*);
|
||||
_puts(ptr, mini_strlen(ptr), &b);
|
||||
break;
|
||||
|
||||
default:
|
||||
_putc(ch, &b);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
end:
|
||||
return b.pbuffer - b.buffer;
|
||||
}
|
||||
|
||||
|
||||
int
|
||||
mini_snprintf(char* buffer, unsigned int buffer_len, const char *fmt, ...)
|
||||
{
|
||||
int ret;
|
||||
va_list va;
|
||||
va_start(va, fmt);
|
||||
ret = mini_vsnprintf(buffer, buffer_len, fmt, va);
|
||||
va_end(va);
|
||||
|
||||
return ret;
|
||||
}
|
|
@ -0,0 +1,50 @@
|
|||
/*
|
||||
* The Minimal snprintf() implementation
|
||||
*
|
||||
* Copyright (c) 2013 Michal Ludvig <michal@logix.cz>
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions are met:
|
||||
* * Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* * Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* * Neither the name of the auhor nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
||||
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
|
||||
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
||||
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
||||
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
||||
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
||||
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
|
||||
#ifndef __MINI_PRINTF__
|
||||
#define __MINI_PRINTF__
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
#include <stdarg.h>
|
||||
|
||||
int mini_vsnprintf(char* buffer, unsigned int buffer_len, const char *fmt, va_list va);
|
||||
int mini_snprintf(char* buffer, unsigned int buffer_len, const char *fmt, ...);
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#define vsnprintf mini_vsnprintf
|
||||
#define snprintf mini_snprintf
|
||||
|
||||
#endif
|
|
@ -0,0 +1,246 @@
|
|||
/*
|
||||
* spi.c
|
||||
*
|
||||
* Copyright (C) 2019-2020 Sylvain Munaut <tnt@246tNt.com>
|
||||
* SPDX-License-Identifier: LGPL-3.0-or-later
|
||||
*/
|
||||
|
||||
#include <stdbool.h>
|
||||
#include <stdint.h>
|
||||
|
||||
#include "config.h"
|
||||
#include "spi.h"
|
||||
|
||||
|
||||
struct spi {
|
||||
uint32_t _rsvd0[6];
|
||||
uint32_t irq; /* 0110 - SPIIRQ - Interrupt Status Register */
|
||||
uint32_t irqen; /* 0111 - SPIIRQEN - Interrupt Control Register */
|
||||
uint32_t cr0; /* 1000 - CR0 - Control Register 0 */
|
||||
uint32_t cr1; /* 1001 - CR1 - Control Register 1 */
|
||||
uint32_t cr2; /* 1010 - CR2 - Control Register 2 */
|
||||
uint32_t br; /* 1011 - BR - Baud Rate Register */
|
||||
uint32_t sr; /* 1100 - SR - Status Register */
|
||||
uint32_t txdr; /* 1101 - TXDR - Transmit Data Register */
|
||||
uint32_t rxdr; /* 1110 - RXDR - Receive Data Register */
|
||||
uint32_t csr; /* 1111 - CSR - Chip Select Register */
|
||||
} __attribute__((packed,aligned(4)));
|
||||
|
||||
#define SPI_CR0_TIDLE(xcnt) (((xcnt) & 3) << 6)
|
||||
#define SPI_CR0_TTRAIL(xcnt) (((xcnt) & 7) << 3)
|
||||
#define SPI_CR0_TLEAD(xcnt) (((xcnt) & 7) << 0)
|
||||
|
||||
#define SPI_CR1_ENABLE (1 << 7)
|
||||
#define SPI_CR1_WKUPEN_USER (1 << 6)
|
||||
#define SPI_CR1_TXEDGE (1 << 4)
|
||||
|
||||
#define SPI_CR2_MASTER (1 << 7)
|
||||
#define SPI_CR2_MCSH (1 << 6)
|
||||
#define SPI_CR2_SDBRE (1 << 5)
|
||||
#define SPI_CR2_CPOL (1 << 2)
|
||||
#define SPI_CR2_CPHA (1 << 1)
|
||||
#define SPI_CR2_LSBF (1 << 0)
|
||||
|
||||
#define SPI_SR_TIP (1 << 7)
|
||||
#define SPI_SR_BUSY (1 << 6)
|
||||
#define SPI_SR_TRDY (1 << 4)
|
||||
#define SPI_SR_RRDY (1 << 3)
|
||||
#define SPI_SR_TOE (1 << 2)
|
||||
#define SPI_SR_ROE (1 << 1)
|
||||
#define SPI_SR_MDF (1 << 0)
|
||||
|
||||
|
||||
static volatile struct spi * const spi_regs[] = {
|
||||
(void*)(SPI_FLASH_BASE),
|
||||
#ifdef BOARD_E1_TRACER
|
||||
(void*)(SPI_LIU_BASE),
|
||||
#endif
|
||||
};
|
||||
|
||||
|
||||
void
|
||||
spi_init(void)
|
||||
{
|
||||
/* Channel 0: Flash */
|
||||
spi_regs[0]->cr0 = SPI_CR0_TIDLE(3) |
|
||||
SPI_CR0_TTRAIL(7) |
|
||||
SPI_CR0_TLEAD(7);
|
||||
|
||||
spi_regs[0]->cr1 = SPI_CR1_ENABLE;
|
||||
spi_regs[0]->cr2 = SPI_CR2_MASTER | SPI_CR2_MCSH;
|
||||
spi_regs[0]->br = 3;
|
||||
spi_regs[0]->csr = 0xf;
|
||||
|
||||
#ifdef BOARD_E1_TRACER
|
||||
/* Channel 1: LIU */
|
||||
spi_regs[1]->cr0 = SPI_CR0_TIDLE(3) |
|
||||
SPI_CR0_TTRAIL(7) |
|
||||
SPI_CR0_TLEAD(7);
|
||||
spi_regs[1]->cr1 = SPI_CR1_ENABLE | SPI_CR1_TXEDGE;
|
||||
spi_regs[1]->cr2 = SPI_CR2_MASTER | SPI_CR2_LSBF | SPI_CR2_MCSH | SPI_CR2_CPHA;
|
||||
spi_regs[1]->br = 3;
|
||||
spi_regs[1]->csr = 0xf;
|
||||
#endif
|
||||
}
|
||||
|
||||
void
|
||||
spi_xfer(unsigned cs, const struct spi_xfer_chunk *xfer, unsigned n)
|
||||
{
|
||||
unsigned chan = (cs >> 2);
|
||||
cs &= 3;
|
||||
|
||||
/* Setup CS */
|
||||
//spi_regs[chan]->cr2 |= SPI_CR2_MCSH;
|
||||
spi_regs[chan]->csr = 0xf ^ (1 << cs);
|
||||
|
||||
/* Run the chunks */
|
||||
while (n--) {
|
||||
for (int i=0; i<xfer->len; i++)
|
||||
{
|
||||
spi_regs[chan]->txdr = xfer->write ? xfer->data[i] : 0x00;
|
||||
while (!(spi_regs[chan]->sr & SPI_SR_RRDY));
|
||||
if (xfer->read)
|
||||
xfer->data[i] = spi_regs[chan]->rxdr;
|
||||
}
|
||||
xfer++;
|
||||
}
|
||||
|
||||
/* Clear CS */
|
||||
//spi_regs[chan]->cr2 &= ~SPI_CR2_MCSH;
|
||||
spi_regs[chan]->csr = 0xf;
|
||||
}
|
||||
|
||||
|
||||
#define FLASH_CMD_DEEP_POWER_DOWN 0xb9
|
||||
#define FLASH_CMD_WAKE_UP 0xab
|
||||
#define FLASH_CMD_WRITE_ENABLE 0x06
|
||||
#define FLASH_CMD_WRITE_ENABLE_VOLATILE 0x50
|
||||
#define FLASH_CMD_WRITE_DISABLE 0x04
|
||||
|
||||
#define FLASH_CMD_READ_MANUF_ID 0x9f
|
||||
#define FLASH_CMD_READ_UNIQUE_ID 0x4b
|
||||
|
||||
#define FLASH_CMD_READ_SR1 0x05
|
||||
#define FLASH_CMD_WRITE_SR1 0x01
|
||||
|
||||
#define FLASH_CMD_READ_DATA 0x03
|
||||
#define FLASH_CMD_PAGE_PROGRAM 0x02
|
||||
#define FLASH_CMD_CHIP_ERASE 0x60
|
||||
#define FLASH_CMD_SECTOR_ERASE 0x20
|
||||
|
||||
void
|
||||
flash_cmd(uint8_t cmd)
|
||||
{
|
||||
struct spi_xfer_chunk xfer[1] = {
|
||||
{ .data = (void*)&cmd, .len = 1, .read = false, .write = true, },
|
||||
};
|
||||
spi_xfer(SPI_CS_FLASH, xfer, 1);
|
||||
}
|
||||
|
||||
void
|
||||
flash_deep_power_down(void)
|
||||
{
|
||||
flash_cmd(FLASH_CMD_DEEP_POWER_DOWN);
|
||||
}
|
||||
|
||||
void
|
||||
flash_wake_up(void)
|
||||
{
|
||||
flash_cmd(FLASH_CMD_WAKE_UP);
|
||||
}
|
||||
|
||||
void
|
||||
flash_write_enable(void)
|
||||
{
|
||||
flash_cmd(FLASH_CMD_WRITE_ENABLE);
|
||||
}
|
||||
|
||||
void
|
||||
flash_write_enable_volatile(void)
|
||||
{
|
||||
flash_cmd(FLASH_CMD_WRITE_ENABLE_VOLATILE);
|
||||
}
|
||||
|
||||
void
|
||||
flash_write_disable(void)
|
||||
{
|
||||
flash_cmd(FLASH_CMD_WRITE_DISABLE);
|
||||
}
|
||||
|
||||
void
|
||||
flash_manuf_id(void *manuf)
|
||||
{
|
||||
uint8_t cmd = FLASH_CMD_READ_MANUF_ID;
|
||||
struct spi_xfer_chunk xfer[2] = {
|
||||
{ .data = (void*)&cmd, .len = 1, .read = false, .write = true, },
|
||||
{ .data = (void*)manuf, .len = 3, .read = true, .write = false, },
|
||||
};
|
||||
spi_xfer(SPI_CS_FLASH, xfer, 2);
|
||||
}
|
||||
|
||||
void
|
||||
flash_unique_id(void *id)
|
||||
{
|
||||
uint8_t cmd = FLASH_CMD_READ_UNIQUE_ID;
|
||||
struct spi_xfer_chunk xfer[3] = {
|
||||
{ .data = (void*)&cmd, .len = 1, .read = false, .write = true, },
|
||||
{ .data = (void*)0, .len = 4, .read = false, .write = false, },
|
||||
{ .data = (void*)id, .len = 8, .read = true, .write = false, },
|
||||
};
|
||||
spi_xfer(SPI_CS_FLASH, xfer, 3);
|
||||
}
|
||||
|
||||
uint8_t
|
||||
flash_read_sr(void)
|
||||
{
|
||||
uint8_t cmd = FLASH_CMD_READ_SR1;
|
||||
uint8_t rv;
|
||||
struct spi_xfer_chunk xfer[2] = {
|
||||
{ .data = (void*)&cmd, .len = 1, .read = false, .write = true, },
|
||||
{ .data = (void*)&rv, .len = 1, .read = true, .write = false, },
|
||||
};
|
||||
spi_xfer(SPI_CS_FLASH, xfer, 2);
|
||||
return rv;
|
||||
}
|
||||
|
||||
void
|
||||
flash_write_sr(uint8_t sr)
|
||||
{
|
||||
uint8_t cmd[2] = { FLASH_CMD_WRITE_SR1, sr };
|
||||
struct spi_xfer_chunk xfer[1] = {
|
||||
{ .data = (void*)cmd, .len = 2, .read = false, .write = true, },
|
||||
};
|
||||
spi_xfer(SPI_CS_FLASH, xfer, 1);
|
||||
}
|
||||
|
||||
void
|
||||
flash_read(void *dst, uint32_t addr, unsigned len)
|
||||
{
|
||||
uint8_t cmd[4] = { FLASH_CMD_READ_DATA, ((addr >> 16) & 0xff), ((addr >> 8) & 0xff), (addr & 0xff) };
|
||||
struct spi_xfer_chunk xfer[2] = {
|
||||
{ .data = (void*)cmd, .len = 4, .read = false, .write = true, },
|
||||
{ .data = (void*)dst, .len = len, .read = true, .write = false, },
|
||||
};
|
||||
spi_xfer(SPI_CS_FLASH, xfer, 2);
|
||||
}
|
||||
|
||||
void
|
||||
flash_page_program(void *src, uint32_t addr, unsigned len)
|
||||
{
|
||||
uint8_t cmd[4] = { FLASH_CMD_PAGE_PROGRAM, ((addr >> 16) & 0xff), ((addr >> 8) & 0xff), (addr & 0xff) };
|
||||
struct spi_xfer_chunk xfer[2] = {
|
||||
{ .data = (void*)cmd, .len = 4, .read = false, .write = true, },
|
||||
{ .data = (void*)src, .len = len, .read = false, .write = true, },
|
||||
};
|
||||
spi_xfer(SPI_CS_FLASH, xfer, 2);
|
||||
}
|
||||
|
||||
void
|
||||
flash_sector_erase(uint32_t addr)
|
||||
{
|
||||
uint8_t cmd[4] = { FLASH_CMD_SECTOR_ERASE, ((addr >> 16) & 0xff), ((addr >> 8) & 0xff), (addr & 0xff) };
|
||||
struct spi_xfer_chunk xfer[1] = {
|
||||
{ .data = (void*)cmd, .len = 4, .read = false, .write = true, },
|
||||
};
|
||||
spi_xfer(SPI_CS_FLASH, xfer, 1);
|
||||
}
|
|
@ -0,0 +1,36 @@
|
|||
/*
|
||||
* spi.h
|
||||
*
|
||||
* Copyright (C) 2019-2020 Sylvain Munaut <tnt@246tNt.com>
|
||||
* SPDX-License-Identifier: LGPL-3.0-or-later
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <stdbool.h>
|
||||
|
||||
struct spi_xfer_chunk {
|
||||
uint8_t *data;
|
||||
unsigned len;
|
||||
bool write;
|
||||
bool read;
|
||||
};
|
||||
|
||||
#define SPI_CS_FLASH 0
|
||||
#define SPI_CS_LIU(n) (4+(n))
|
||||
|
||||
void spi_init(void);
|
||||
void spi_xfer(unsigned cs, const struct spi_xfer_chunk *xfer, unsigned n);
|
||||
|
||||
void flash_cmd(uint8_t cmd);
|
||||
void flash_deep_power_down(void);
|
||||
void flash_wake_up(void);
|
||||
void flash_write_enable(void);
|
||||
void flash_write_disable(void);
|
||||
void flash_manuf_id(void *manuf);
|
||||
void flash_unique_id(void *id);
|
||||
uint8_t flash_read_sr(void);
|
||||
void flash_write_sr(uint8_t sr);
|
||||
void flash_read(void *dst, uint32_t addr, unsigned len);
|
||||
void flash_page_program(void *src, uint32_t addr, unsigned len);
|
||||
void flash_sector_erase(uint32_t addr);
|
|
@ -0,0 +1,110 @@
|
|||
/*
|
||||
* start.S
|
||||
*
|
||||
* Startup code taken from picosoc/picorv32 and adapted for use here
|
||||
*
|
||||
* Copyright (C) 2017 Clifford Wolf <clifford@clifford.at>
|
||||
* Copyright (C) 2019 Sylvain Munaut <tnt@246tNt.com>
|
||||
*
|
||||
* Permission to use, copy, modify, and/or distribute this software for any
|
||||
* purpose with or without fee is hereby granted, provided that the above
|
||||
* copyright notice and this permission notice appear in all copies.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
||||
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
||||
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
||||
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
||||
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
||||
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
||||
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
||||
*/
|
||||
|
||||
.section .text.start
|
||||
.global _start
|
||||
_start:
|
||||
|
||||
// zero-initialize register file
|
||||
addi x1, zero, 0
|
||||
// x2 (sp) is initialized by reset
|
||||
addi x3, zero, 0
|
||||
addi x4, zero, 0
|
||||
addi x5, zero, 0
|
||||
addi x6, zero, 0
|
||||
addi x7, zero, 0
|
||||
addi x8, zero, 0
|
||||
addi x9, zero, 0
|
||||
addi x10, zero, 0
|
||||
addi x11, zero, 0
|
||||
addi x12, zero, 0
|
||||
addi x13, zero, 0
|
||||
addi x14, zero, 0
|
||||
addi x15, zero, 0
|
||||
addi x16, zero, 0
|
||||
addi x17, zero, 0
|
||||
addi x18, zero, 0
|
||||
addi x19, zero, 0
|
||||
addi x20, zero, 0
|
||||
addi x21, zero, 0
|
||||
addi x22, zero, 0
|
||||
addi x23, zero, 0
|
||||
addi x24, zero, 0
|
||||
addi x25, zero, 0
|
||||
addi x26, zero, 0
|
||||
addi x27, zero, 0
|
||||
addi x28, zero, 0
|
||||
addi x29, zero, 0
|
||||
addi x30, zero, 0
|
||||
addi x31, zero, 0
|
||||
|
||||
#ifdef BOOT_DEBUG
|
||||
// Set UART divisor
|
||||
li a0, 0x81000000
|
||||
li a1, 28
|
||||
sw a1, 4(a0)
|
||||
|
||||
// Output '1'
|
||||
li a1, 49
|
||||
sw a1, 0(a0)
|
||||
#endif
|
||||
|
||||
// copy data section
|
||||
la a0, _sidata
|
||||
la a1, _sdata
|
||||
la a2, _edata
|
||||
bge a1, a2, end_init_data
|
||||
loop_init_data:
|
||||
lw a3, 0(a0)
|
||||
sw a3, 0(a1)
|
||||
addi a0, a0, 4
|
||||
addi a1, a1, 4
|
||||
blt a1, a2, loop_init_data
|
||||
end_init_data:
|
||||
|
||||
#ifdef BOOT_DEBUG
|
||||
// Output '2'
|
||||
li a0, 0x81000000
|
||||
li a1, 50
|
||||
sw a1, 0(a0)
|
||||
#endif
|
||||
|
||||
// zero-init bss section
|
||||
la a0, _sbss
|
||||
la a1, _ebss
|
||||
bge a0, a1, end_init_bss
|
||||
loop_init_bss:
|
||||
sw zero, 0(a0)
|
||||
addi a0, a0, 4
|
||||
blt a0, a1, loop_init_bss
|
||||
end_init_bss:
|
||||
|
||||
#ifdef BOOT_DEBUG
|
||||
// Output '3'
|
||||
li a0, 0x81000000
|
||||
li a1, 51
|
||||
sw a1, 0(a0)
|
||||
#endif
|
||||
|
||||
// call main
|
||||
call main
|
||||
loop:
|
||||
j loop
|
|
@ -0,0 +1,31 @@
|
|||
/*
|
||||
* utils.c
|
||||
*
|
||||
* Copyright (C) 2019-2020 Sylvain Munaut <tnt@246tNt.com>
|
||||
* SPDX-License-Identifier: LGPL-3.0-or-later
|
||||
*/
|
||||
|
||||
#include <stdint.h>
|
||||
#include <stdbool.h>
|
||||
|
||||
char *
|
||||
hexstr(void *d, int n, bool space)
|
||||
{
|
||||
static const char * const hex = "0123456789abcdef";
|
||||
static char buf[96];
|
||||
uint8_t *p = d;
|
||||
char *s = buf;
|
||||
char c;
|
||||
|
||||
while (n--) {
|
||||
c = *p++;
|
||||
*s++ = hex[c >> 4];
|
||||
*s++ = hex[c & 0xf];
|
||||
if (space)
|
||||
*s++ = ' ';
|
||||
}
|
||||
|
||||
s[space?-1:0] = '\0';
|
||||
|
||||
return buf;
|
||||
}
|
|
@ -0,0 +1,12 @@
|
|||
/*
|
||||
* utils.h
|
||||
*
|
||||
* Copyright (C) 2019-2020 Sylvain Munaut <tnt@246tNt.com>
|
||||
* SPDX-License-Identifier: LGPL-3.0-or-later
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <stdbool.h>
|
||||
|
||||
char *hexstr(void *d, int n, bool space);
|
Loading…
Reference in New Issue