Compare commits
10 commits
09db1687dd
...
62e56052cf
| Author | SHA1 | Date | |
|---|---|---|---|
| 62e56052cf | |||
|
|
4e9f7f4d22 | ||
|
|
04ec37adea | ||
|
|
15da8f9f2f |
||
|
|
4743976211 | ||
|
|
099e682b9d | ||
|
|
0399047449 | ||
|
|
ae29db2fd7 |
||
|
|
a1a063b0c8 | ||
|
|
ece51eaedd |
19 changed files with 963 additions and 733 deletions
|
|
@ -6,6 +6,12 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
|
|||
|
||||
## [Unreleased]
|
||||
|
||||
## [0.6.0] - March 21st, 2025
|
||||
- [breaking] The driver now uses v0.9 of embedded-nal [@reitermarkus](https://github.com/reitermarkus) ([#66](https://github.com/kellerkindt/w5500/pull/66))
|
||||
- `DeviceState` is now publicly re-exported [@22dd5e2bdd](https://github.com/22dd5e2bdd) ([#65](https://github.com/kellerkindt/w5500/pull/65))
|
||||
|
||||
## [0.5.0] - July 8th, 2024
|
||||
|
||||
### Changed
|
||||
- [breaking] The driver now uses the v1.0 of the `embedded-hal` traits.
|
||||
- [breaking] The `FourWireRef` bus and `DeviceRefMut` have been removed in favor of using
|
||||
|
|
|
|||
23
Cargo.toml
23
Cargo.toml
|
|
@ -1,22 +1,25 @@
|
|||
[package]
|
||||
name = "w5500"
|
||||
version = "0.4.1"
|
||||
authors = ["Michael Watzko <michael@watzko.de>", "Jonah Dahlquist <hi@jonah.name>", "Ryan Summers <ryan.summers@vertigo-designs.com"]
|
||||
repository = "https://github.com/kellerkindt/w5500.git"
|
||||
description = "W5500 IoT Controller implementation."
|
||||
keywords = ["embedded", "w5500", "iot", "arm", "embedded-hal-driver"]
|
||||
name = "w5100"
|
||||
version = "0.1.0"
|
||||
authors = [
|
||||
"Michael Watzko <michael@watzko.de>",
|
||||
"Jonah Dahlquist <hi@jonah.name>",
|
||||
"Ryan Summers <ryan.summers@vertigo-designs.com",
|
||||
"Pascal Engélibert <tuxmain@zettascript.org>"
|
||||
]
|
||||
repository = "https://git.zoai.re/tuxmain/w5100-rs"
|
||||
description = "W5100 Ethernet driver"
|
||||
keywords = ["embedded", "w5100", "embedded-hal-driver"]
|
||||
categories = ["embedded", "hardware-support", "no-std", "network-programming"]
|
||||
license = "MIT OR Apache-2.0"
|
||||
license = "AGPL-3.0-only"
|
||||
readme = "README.md"
|
||||
edition = "2018"
|
||||
|
||||
[features]
|
||||
no-chip-version-assertion = []
|
||||
|
||||
[dependencies]
|
||||
byteorder = { version = "1.3.4", default-features = false }
|
||||
embedded-hal = "1"
|
||||
embedded-nal = "0.8.0"
|
||||
embedded-nal = "0.9.0"
|
||||
bit_field = "0.10"
|
||||
derive-try-from-primitive = "1"
|
||||
nb = "1.0.0"
|
||||
|
|
|
|||
661
LICENSE
Normal file
661
LICENSE
Normal file
|
|
@ -0,0 +1,661 @@
|
|||
GNU AFFERO GENERAL PUBLIC LICENSE
|
||||
Version 3, 19 November 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 Affero General Public License is a free, copyleft license for
|
||||
software and other kinds of works, specifically designed to ensure
|
||||
cooperation with the community in the case of network server software.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
our General Public Licenses are 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.
|
||||
|
||||
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.
|
||||
|
||||
Developers that use our General Public Licenses protect your rights
|
||||
with two steps: (1) assert copyright on the software, and (2) offer
|
||||
you this License which gives you legal permission to copy, distribute
|
||||
and/or modify the software.
|
||||
|
||||
A secondary benefit of defending all users' freedom is that
|
||||
improvements made in alternate versions of the program, if they
|
||||
receive widespread use, become available for other developers to
|
||||
incorporate. Many developers of free software are heartened and
|
||||
encouraged by the resulting cooperation. However, in the case of
|
||||
software used on network servers, this result may fail to come about.
|
||||
The GNU General Public License permits making a modified version and
|
||||
letting the public access it on a server without ever releasing its
|
||||
source code to the public.
|
||||
|
||||
The GNU Affero General Public License is designed specifically to
|
||||
ensure that, in such cases, the modified source code becomes available
|
||||
to the community. It requires the operator of a network server to
|
||||
provide the source code of the modified version running there to the
|
||||
users of that server. Therefore, public use of a modified version, on
|
||||
a publicly accessible server, gives the public access to the source
|
||||
code of the modified version.
|
||||
|
||||
An older license, called the Affero General Public License and
|
||||
published by Affero, was designed to accomplish similar goals. This is
|
||||
a different license, not a version of the Affero GPL, but Affero has
|
||||
released a new version of the Affero GPL which permits relicensing under
|
||||
this license.
|
||||
|
||||
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 Affero 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. Remote Network Interaction; Use with the GNU General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, if you modify the
|
||||
Program, your modified version must prominently offer all users
|
||||
interacting with it remotely through a computer network (if your version
|
||||
supports such interaction) an opportunity to receive the Corresponding
|
||||
Source of your version by providing access to the Corresponding Source
|
||||
from a network server at no charge, through some standard or customary
|
||||
means of facilitating copying of software. This Corresponding Source
|
||||
shall include the Corresponding Source for any work covered by version 3
|
||||
of the GNU General Public License that is incorporated pursuant to the
|
||||
following paragraph.
|
||||
|
||||
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 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 work with which it is combined will remain governed by version
|
||||
3 of the GNU General Public License.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU Affero 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 Affero 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 Affero 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 Affero 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 Affero 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 Affero General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Affero 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 your software can interact with users remotely through a computer
|
||||
network, you should also make sure that it provides a way for users to
|
||||
get its source. For example, if your program is a web application, its
|
||||
interface could display a "Source" link that leads users to an archive
|
||||
of the code. There are many ways you could offer source, and different
|
||||
solutions will be better for different programs; see section 13 for the
|
||||
specific requirements.
|
||||
|
||||
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 AGPL, see
|
||||
<https://www.gnu.org/licenses/>.
|
||||
31
README.md
31
README.md
|
|
@ -1,4 +1,9 @@
|
|||
# W5500 Driver
|
||||
# W5100 Driver
|
||||
|
||||
**Fork status**:
|
||||
* Work-in-progress fork of the crate [w5500](https://github.com/kellerkindt/w5500) for W5100. The two chips are different versions of the same design, very similar but not fully compatible. The older revision of the Arduino Ethernet Shield uses W5100, hence the need for this fork.
|
||||
* What works: receive and send UDP packets.
|
||||
* Tested on Arduino Uno with Arduino Ethernet Shield.
|
||||
|
||||
This crate is a driver for the WIZnet W5500 chip. The W5500 chip is a hardwired TCP/IP embedded Ethernet controller
|
||||
that enables embedded systems using SPI (Serial Peripheral Interface) to access the LAN. It is one of the
|
||||
|
|
@ -32,7 +37,7 @@ of the SPI implementation. It must be set up to work as the W5500 chip requires
|
|||
* Clock speed: 33MHz maximum
|
||||
|
||||
```rust,no_run
|
||||
use embedded_nal::{IpAddr, Ipv4Addr, SocketAddr};
|
||||
use core::net::{IpAddr, Ipv4Addr, SocketAddr};
|
||||
#
|
||||
# struct Mock;
|
||||
#
|
||||
|
|
@ -50,11 +55,11 @@ use embedded_nal::UdpClientStack;
|
|||
let mut spi = Mock;
|
||||
|
||||
let mut device = w5500::UninitializedDevice::new(w5500::bus::FourWire::new(spi))
|
||||
.initialize_manual(
|
||||
w5500::MacAddress::new(0, 1, 2, 3, 4, 5),
|
||||
Ipv4Addr::new(192, 168, 86, 79),
|
||||
w5500::Mode::default()
|
||||
).unwrap();
|
||||
.initialize_manual(
|
||||
w5500::MacAddress::new(0, 1, 2, 3, 4, 5),
|
||||
Ipv4Addr::new(192, 168, 86, 79),
|
||||
w5500::Mode::default()
|
||||
).unwrap();
|
||||
|
||||
// Allocate a UDP socket to send data with
|
||||
let mut socket = device.socket().unwrap();
|
||||
|
|
@ -76,3 +81,15 @@ In no particular order, things to do to improve this driver.
|
|||
|
||||
* Add support for TCP server implementations
|
||||
* Add support for DHCP
|
||||
|
||||
## License
|
||||
|
||||
[Support me via LiberaPay](https://liberapay.com/tuxmain/donate)
|
||||
|
||||
Based on [w5500](https://github.com/kellerkindt/w5500) licensed under MIT/Apache, see Git history for the list of contributors.
|
||||
|
||||
GNU AGPL v3, CopyLeft 2025 Pascal Engélibert [(why copyleft?)](https://txmn.tk/blog/why-copyleft/)
|
||||
|
||||
This program is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, version 3 of the License.
|
||||
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 Affero General Public License for more details.
|
||||
You should have received a copy of the GNU Affero General Public License along with this program. If not, see https://www.gnu.org/licenses/.
|
||||
|
|
|
|||
|
|
@ -5,7 +5,8 @@ use embedded_hal::spi::{ErrorType, Operation, SpiDevice};
|
|||
|
||||
use crate::bus::Bus;
|
||||
|
||||
const WRITE_MODE_MASK: u8 = 0b00000_1_00;
|
||||
const OPMODE_READ: u8 = 0x0f;
|
||||
const OPMODE_WRITE: u8 = 0xf0;
|
||||
|
||||
// TODO This name is not ideal, should be renamed to VDM
|
||||
#[derive(Debug)]
|
||||
|
|
@ -27,96 +28,28 @@ impl<SPI> FourWire<SPI> {
|
|||
impl<SPI: SpiDevice> Bus for FourWire<SPI> {
|
||||
type Error = <SPI as ErrorType>::Error;
|
||||
|
||||
fn read_frame(&mut self, block: u8, address: u16, data: &mut [u8]) -> Result<(), SPI::Error> {
|
||||
fn read_frame(&mut self, address: u16, data: &mut [u8]) -> Result<(), SPI::Error> {
|
||||
let address_phase = address.to_be_bytes();
|
||||
let control_phase = block << 3;
|
||||
|
||||
self.spi.transaction(&mut [
|
||||
Operation::Write(&address_phase),
|
||||
Operation::Write(&[control_phase]),
|
||||
Operation::TransferInPlace(data),
|
||||
])?;
|
||||
for (i, byte) in data.iter_mut().enumerate() {
|
||||
self.spi.transaction(&mut [
|
||||
Operation::Write(&[OPMODE_READ]),
|
||||
Operation::Write(&(address+i as u16).to_be_bytes()),
|
||||
Operation::TransferInPlace(core::array::from_mut(byte)),
|
||||
])?;
|
||||
}
|
||||
|
||||
Ok(())
|
||||
}
|
||||
|
||||
fn write_frame(&mut self, block: u8, address: u16, data: &[u8]) -> Result<(), SPI::Error> {
|
||||
let control_phase = block << 3 | WRITE_MODE_MASK;
|
||||
|
||||
let address_phase = address.to_be_bytes();
|
||||
self.spi.transaction(&mut [
|
||||
Operation::Write(&address_phase),
|
||||
Operation::Write(&[control_phase]),
|
||||
Operation::Write(data),
|
||||
])?;
|
||||
fn write_frame(&mut self, address: u16, data: &[u8]) -> Result<(), SPI::Error> {
|
||||
for (i, byte) in data.iter().enumerate() {
|
||||
self.spi.transaction(&mut [
|
||||
Operation::Write(&[OPMODE_WRITE]),
|
||||
Operation::Write(&(address+i as u16).to_be_bytes()),
|
||||
Operation::Write(&[*byte]),
|
||||
])?;
|
||||
}
|
||||
|
||||
Ok(())
|
||||
}
|
||||
}
|
||||
|
||||
#[cfg(test)]
|
||||
mod test {
|
||||
use embedded_hal_mock::eh1::spi::{Mock as SpiMock, Transaction as SpiTransaction};
|
||||
|
||||
use crate::{
|
||||
bus::{four_wire::WRITE_MODE_MASK, Bus},
|
||||
register,
|
||||
};
|
||||
|
||||
use super::FourWire;
|
||||
|
||||
#[test]
|
||||
fn test_read_frame() {
|
||||
let mut actual_version = [0_u8; 1];
|
||||
let mut expected_version = 5;
|
||||
|
||||
let expectations = [
|
||||
SpiTransaction::transaction_start(),
|
||||
SpiTransaction::write_vec(register::common::VERSION.to_be_bytes().to_vec()),
|
||||
SpiTransaction::write(register::COMMON << 3),
|
||||
SpiTransaction::transfer_in_place(actual_version.to_vec(), vec![expected_version]),
|
||||
SpiTransaction::transaction_end(),
|
||||
];
|
||||
|
||||
let mock_spi = SpiMock::new(&expectations);
|
||||
|
||||
let mut four_wire = FourWire::new(mock_spi);
|
||||
|
||||
four_wire.read_frame(
|
||||
register::COMMON,
|
||||
register::common::VERSION,
|
||||
&mut actual_version,
|
||||
);
|
||||
|
||||
four_wire.release().done();
|
||||
|
||||
assert_eq!(expected_version, actual_version[0]);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_write_frame() {
|
||||
let socket_0_reg = 0x01_u8;
|
||||
let socket_1_reg = 0x05_u8;
|
||||
let source_port = 49849_u16;
|
||||
|
||||
let expectations = [
|
||||
SpiTransaction::transaction_start(),
|
||||
SpiTransaction::write_vec(register::socketn::SOURCE_PORT.to_be_bytes().to_vec()),
|
||||
SpiTransaction::write(socket_1_reg << 3 | WRITE_MODE_MASK),
|
||||
SpiTransaction::write_vec(source_port.to_be_bytes().to_vec()),
|
||||
SpiTransaction::transaction_end(),
|
||||
];
|
||||
|
||||
let mock_spi = SpiMock::new(&expectations);
|
||||
|
||||
let mut four_wire = FourWire::new(mock_spi);
|
||||
|
||||
four_wire.write_frame(
|
||||
socket_1_reg,
|
||||
register::socketn::SOURCE_PORT,
|
||||
&source_port.to_be_bytes(),
|
||||
);
|
||||
|
||||
four_wire.release().done();
|
||||
}
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,16 +1,13 @@
|
|||
use core::fmt::Debug;
|
||||
|
||||
mod four_wire;
|
||||
mod three_wire;
|
||||
|
||||
pub use self::four_wire::FourWire;
|
||||
pub use self::three_wire::ThreeWire;
|
||||
pub use self::three_wire::ThreeWireError;
|
||||
|
||||
pub trait Bus {
|
||||
type Error: Debug;
|
||||
|
||||
fn read_frame(&mut self, block: u8, address: u16, data: &mut [u8]) -> Result<(), Self::Error>;
|
||||
fn read_frame(&mut self, address: u16, data: &mut [u8]) -> Result<(), Self::Error>;
|
||||
|
||||
fn write_frame(&mut self, block: u8, address: u16, data: &[u8]) -> Result<(), Self::Error>;
|
||||
fn write_frame(&mut self, address: u16, data: &[u8]) -> Result<(), Self::Error>;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,127 +0,0 @@
|
|||
#![allow(clippy::inconsistent_digit_grouping, clippy::unusual_byte_groupings)]
|
||||
|
||||
use core::fmt;
|
||||
use embedded_hal::spi::{ErrorType, Operation, SpiBus};
|
||||
|
||||
use crate::bus::Bus;
|
||||
|
||||
const WRITE_MODE_MASK: u8 = 0b00000_1_0;
|
||||
|
||||
const FIXED_DATA_LENGTH_MODE_1: u8 = 0b000000_01;
|
||||
const FIXED_DATA_LENGTH_MODE_2: u8 = 0b000000_10;
|
||||
const FIXED_DATA_LENGTH_MODE_4: u8 = 0b000000_11;
|
||||
|
||||
// TODO This name is not ideal, should be renamed to FDM
|
||||
#[derive(Debug)]
|
||||
#[cfg_attr(feature = "defmt", derive(defmt::Format))]
|
||||
pub struct ThreeWire<SPI> {
|
||||
spi: SPI,
|
||||
}
|
||||
|
||||
impl<SPI> ThreeWire<SPI> {
|
||||
pub fn new(spi: SPI) -> Self {
|
||||
Self { spi }
|
||||
}
|
||||
|
||||
pub fn release(self) -> SPI {
|
||||
self.spi
|
||||
}
|
||||
}
|
||||
|
||||
impl<SPI: SpiBus> Bus for ThreeWire<SPI> {
|
||||
type Error = <SPI as ErrorType>::Error;
|
||||
|
||||
/// Transfers a frame with an arbitrary data length in FDM
|
||||
///
|
||||
/// This is done by passing chunks of fixed length 4, 2, or 1. For example if a frame looks like this:
|
||||
///
|
||||
/// (address 23) 0xF0 0xAB 0x83 0xB2 0x44 0x2C 0xAA
|
||||
///
|
||||
/// This will be sent as separate frames in the chunks
|
||||
///
|
||||
/// (address 23) 0xF0 0xAB 0x83 0xB2
|
||||
/// (address 27) 44 2C
|
||||
/// (address 29) AA
|
||||
fn read_frame(
|
||||
&mut self,
|
||||
block: u8,
|
||||
mut address: u16,
|
||||
data: &mut [u8],
|
||||
) -> Result<(), Self::Error> {
|
||||
let mut control_phase = block << 3;
|
||||
|
||||
let mut data_phase = data;
|
||||
let mut last_length_written: u16;
|
||||
while !data_phase.is_empty() {
|
||||
if data_phase.len() >= 4 {
|
||||
control_phase |= FIXED_DATA_LENGTH_MODE_4;
|
||||
last_length_written = 4;
|
||||
} else if data_phase.len() >= 2 {
|
||||
control_phase |= FIXED_DATA_LENGTH_MODE_2;
|
||||
last_length_written = 2;
|
||||
} else {
|
||||
control_phase |= FIXED_DATA_LENGTH_MODE_1;
|
||||
last_length_written = 1;
|
||||
}
|
||||
|
||||
let address_phase = address.to_be_bytes();
|
||||
self.spi
|
||||
.write(&address_phase)
|
||||
.and_then(|_| self.spi.write(&[control_phase]))?;
|
||||
self.spi
|
||||
.transfer_in_place(&mut data_phase[..last_length_written as usize])?;
|
||||
|
||||
address += last_length_written;
|
||||
data_phase = &mut data_phase[last_length_written as usize..];
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
||||
fn write_frame(&mut self, block: u8, mut address: u16, data: &[u8]) -> Result<(), Self::Error> {
|
||||
let mut control_phase = block << 3 | WRITE_MODE_MASK;
|
||||
|
||||
let mut data_phase = data;
|
||||
let mut last_length_written: u16;
|
||||
while !data_phase.is_empty() {
|
||||
if data_phase.len() >= 4 {
|
||||
control_phase |= FIXED_DATA_LENGTH_MODE_4;
|
||||
last_length_written = 4;
|
||||
} else if data_phase.len() >= 2 {
|
||||
control_phase |= FIXED_DATA_LENGTH_MODE_2;
|
||||
last_length_written = 2;
|
||||
} else {
|
||||
control_phase |= FIXED_DATA_LENGTH_MODE_1;
|
||||
last_length_written = 1;
|
||||
}
|
||||
|
||||
let address_phase = address.to_be_bytes();
|
||||
self.spi
|
||||
.write(&address_phase)
|
||||
.and_then(|_| self.spi.write(&[control_phase]))
|
||||
.and_then(|_| self.spi.write(&data_phase[..last_length_written as usize]))?;
|
||||
|
||||
address += last_length_written;
|
||||
data_phase = &data_phase[last_length_written as usize..];
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
}
|
||||
|
||||
// Must use map_err, ambiguity prevents From from being implemented
|
||||
pub enum ThreeWireError<TransferError, WriteError> {
|
||||
TransferError(TransferError),
|
||||
WriteError(WriteError),
|
||||
}
|
||||
|
||||
impl<TransferError, WriteError> fmt::Debug for ThreeWireError<TransferError, WriteError> {
|
||||
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
|
||||
write!(
|
||||
f,
|
||||
"ThreeWireError::{}",
|
||||
match self {
|
||||
Self::TransferError(_) => "TransferError",
|
||||
Self::WriteError(_) => "WriteError",
|
||||
}
|
||||
)
|
||||
}
|
||||
}
|
||||
|
|
@ -40,7 +40,7 @@ where
|
|||
|
||||
let count = self.available().min(buf.len() as u16);
|
||||
self.bus
|
||||
.read_frame(self.sock.rx_buffer(), self.ptr, &mut buf[..count as _])?;
|
||||
.read_frame(self.ptr, &mut buf[..count as _])?;
|
||||
Ok(self.skip(count))
|
||||
}
|
||||
|
||||
|
|
@ -110,7 +110,7 @@ where
|
|||
|
||||
let count = buf.len() as u16;
|
||||
self.bus
|
||||
.write_frame(self.sock.tx_buffer(), self.ptr, &buf[..count as _])?;
|
||||
.write_frame(self.ptr, &buf[..count as _])?;
|
||||
self.ptr = self.ptr.wrapping_add(count);
|
||||
self.size -= count;
|
||||
Ok(count)
|
||||
|
|
|
|||
|
|
@ -1,6 +1,6 @@
|
|||
use bit_field::BitField;
|
||||
|
||||
use crate::bus::{Bus, FourWire, ThreeWire};
|
||||
use crate::bus::{Bus, FourWire};
|
||||
use crate::host::Host;
|
||||
use crate::net::Ipv4Addr;
|
||||
use crate::socket::Socket;
|
||||
|
|
@ -26,7 +26,7 @@ impl<E> From<E> for ResetError<E> {
|
|||
mod private {
|
||||
pub trait Sealed {}
|
||||
|
||||
impl<'a, T: Sealed> Sealed for &'a mut T {}
|
||||
impl<T: Sealed> Sealed for &'_ mut T {}
|
||||
}
|
||||
|
||||
pub trait State: private::Sealed {
|
||||
|
|
@ -73,7 +73,7 @@ impl<HostImpl: Host> State for DeviceState<HostImpl> {
|
|||
}
|
||||
}
|
||||
|
||||
impl<'a, T: State> State for &'a mut T {
|
||||
impl<T: State> State for &'_ mut T {
|
||||
fn socket(&mut self) -> Option<Socket> {
|
||||
T::socket(self)
|
||||
}
|
||||
|
|
@ -126,65 +126,86 @@ impl<SpiBus: Bus, StateImpl: State> Device<SpiBus, StateImpl> {
|
|||
pub fn gateway(&mut self) -> Result<Ipv4Addr, SpiBus::Error> {
|
||||
let mut octets = [0u8; 4];
|
||||
self.bus
|
||||
.read_frame(register::COMMON, register::common::GATEWAY, &mut octets)?;
|
||||
.read_frame(register::COMMON + register::common::GATEWAY, &mut octets)?;
|
||||
Ok(Ipv4Addr::from(octets))
|
||||
}
|
||||
|
||||
pub fn subnet_mask(&mut self) -> Result<Ipv4Addr, SpiBus::Error> {
|
||||
let mut octets = [0u8; 4];
|
||||
self.bus
|
||||
.read_frame(register::COMMON, register::common::SUBNET_MASK, &mut octets)?;
|
||||
.read_frame(register::COMMON + register::common::SUBNET_MASK, &mut octets)?;
|
||||
Ok(Ipv4Addr::from(octets))
|
||||
}
|
||||
|
||||
pub fn mac(&mut self) -> Result<MacAddress, SpiBus::Error> {
|
||||
let mut mac = MacAddress::default();
|
||||
self.bus
|
||||
.read_frame(register::COMMON, register::common::MAC, &mut mac.octets)?;
|
||||
.read_frame(register::COMMON + register::common::MAC, &mut mac.octets)?;
|
||||
Ok(mac)
|
||||
}
|
||||
|
||||
pub fn ip(&mut self) -> Result<Ipv4Addr, SpiBus::Error> {
|
||||
let mut octets = [0u8; 4];
|
||||
self.bus
|
||||
.read_frame(register::COMMON, register::common::IP, &mut octets)?;
|
||||
.read_frame(register::COMMON + register::common::IP, &mut octets)?;
|
||||
Ok(Ipv4Addr::from(octets))
|
||||
}
|
||||
|
||||
pub fn phy_config(&mut self) -> Result<register::common::PhyConfig, SpiBus::Error> {
|
||||
let mut phy = [0u8];
|
||||
self.bus
|
||||
.read_frame(register::COMMON, register::common::PHY_CONFIG, &mut phy)?;
|
||||
Ok(phy[0].into())
|
||||
}
|
||||
|
||||
#[inline]
|
||||
pub fn reset_device(&mut self) -> Result<(), SpiBus::Error> {
|
||||
// Set RST common register of the w5500
|
||||
let mode = [0b10000000];
|
||||
self.bus
|
||||
.write_frame(register::COMMON, register::common::MODE, &mode)
|
||||
.write_frame(register::COMMON + register::common::MODE, &mode)
|
||||
}
|
||||
|
||||
#[inline]
|
||||
pub fn set_mode(&mut self, mode_options: Mode) -> Result<(), SpiBus::Error> {
|
||||
self.bus.write_frame(
|
||||
register::COMMON,
|
||||
register::COMMON +
|
||||
register::common::MODE,
|
||||
&mode_options.to_register(),
|
||||
)
|
||||
}
|
||||
|
||||
#[inline]
|
||||
pub fn version(&mut self) -> Result<u8, SpiBus::Error> {
|
||||
let mut version_register = [0_u8];
|
||||
self.bus.read_frame(
|
||||
register::COMMON,
|
||||
register::common::VERSION,
|
||||
&mut version_register,
|
||||
)?;
|
||||
pub fn set_rx_memory_size(&mut self, val: u8) -> Result<(), SpiBus::Error> {
|
||||
self.bus.write_frame(
|
||||
register::COMMON +
|
||||
register::common::RX_MEMORY_SIZE,
|
||||
&[val],
|
||||
)
|
||||
}
|
||||
|
||||
Ok(version_register[0])
|
||||
#[inline]
|
||||
pub fn set_tx_memory_size(&mut self, val: u8) -> Result<(), SpiBus::Error> {
|
||||
self.bus.write_frame(
|
||||
register::COMMON +
|
||||
register::common::TX_MEMORY_SIZE,
|
||||
&[val],
|
||||
)
|
||||
}
|
||||
|
||||
#[inline]
|
||||
pub fn get_rx_memory_size(&mut self) -> Result<u8, SpiBus::Error> {
|
||||
let mut val = [0];
|
||||
self.bus.read_frame(
|
||||
register::COMMON +
|
||||
register::common::RX_MEMORY_SIZE,
|
||||
&mut val,
|
||||
)?;
|
||||
Ok(val[0])
|
||||
}
|
||||
|
||||
#[inline]
|
||||
pub fn get_tx_memory_size(&mut self) -> Result<u8, SpiBus::Error> {
|
||||
let mut val = [0];
|
||||
self.bus.read_frame(
|
||||
register::COMMON +
|
||||
register::common::TX_MEMORY_SIZE,
|
||||
&mut val,
|
||||
)?;
|
||||
Ok(val[0])
|
||||
}
|
||||
|
||||
/// Set a new value for the Retry Time-value Register.
|
||||
|
|
@ -206,7 +227,7 @@ impl<SpiBus: Bus, StateImpl: State> Device<SpiBus, StateImpl> {
|
|||
#[inline]
|
||||
pub fn set_retry_timeout(&mut self, retry_time_value: RetryTime) -> Result<(), SpiBus::Error> {
|
||||
self.bus.write_frame(
|
||||
register::COMMON,
|
||||
register::COMMON +
|
||||
register::common::RETRY_TIME,
|
||||
&retry_time_value.to_register(),
|
||||
)?;
|
||||
|
|
@ -223,7 +244,7 @@ impl<SpiBus: Bus, StateImpl: State> Device<SpiBus, StateImpl> {
|
|||
pub fn current_retry_timeout(&mut self) -> Result<RetryTime, SpiBus::Error> {
|
||||
let mut retry_time_register: [u8; 2] = [0, 0];
|
||||
self.bus.read_frame(
|
||||
register::COMMON,
|
||||
register::COMMON+
|
||||
register::common::RETRY_TIME,
|
||||
&mut retry_time_register,
|
||||
)?;
|
||||
|
|
@ -249,7 +270,7 @@ impl<SpiBus: Bus, StateImpl: State> Device<SpiBus, StateImpl> {
|
|||
/// `RCR = 0x0007`
|
||||
pub fn set_retry_count(&mut self, retry_count: u8) -> Result<(), SpiBus::Error> {
|
||||
self.bus.write_frame(
|
||||
register::COMMON,
|
||||
register::COMMON+
|
||||
register::common::RETRY_COUNT,
|
||||
&[retry_count],
|
||||
)?;
|
||||
|
|
@ -267,7 +288,7 @@ impl<SpiBus: Bus, StateImpl: State> Device<SpiBus, StateImpl> {
|
|||
pub fn current_retry_count(&mut self) -> Result<u8, SpiBus::Error> {
|
||||
let mut retry_count_register: [u8; 1] = [0];
|
||||
self.bus.read_frame(
|
||||
register::COMMON,
|
||||
register::COMMON+
|
||||
register::common::RETRY_COUNT,
|
||||
&mut retry_count_register,
|
||||
)?;
|
||||
|
|
|
|||
|
|
@ -1,7 +1,8 @@
|
|||
use core::net::Ipv4Addr;
|
||||
|
||||
use crate::bus::Bus;
|
||||
use crate::host::{Host, HostConfig};
|
||||
use crate::MacAddress;
|
||||
use embedded_nal::Ipv4Addr;
|
||||
|
||||
#[derive(Debug)]
|
||||
#[cfg_attr(feature = "defmt", derive(defmt::Format))]
|
||||
|
|
|
|||
|
|
@ -1,3 +1,5 @@
|
|||
use core::net::Ipv4Addr;
|
||||
|
||||
mod dhcp;
|
||||
mod manual;
|
||||
|
||||
|
|
@ -6,7 +8,6 @@ pub use self::manual::Manual;
|
|||
use crate::bus::Bus;
|
||||
use crate::register;
|
||||
use crate::MacAddress;
|
||||
use embedded_nal::Ipv4Addr;
|
||||
|
||||
#[derive(Debug)]
|
||||
#[cfg_attr(feature = "defmt", derive(defmt::Format))]
|
||||
|
|
@ -46,22 +47,22 @@ pub trait Host {
|
|||
) -> Result<(), SpiBus::Error> {
|
||||
if settings.gateway != current.gateway {
|
||||
let address = settings.gateway.octets();
|
||||
bus.write_frame(register::COMMON, register::common::GATEWAY, &address)?;
|
||||
bus.write_frame(register::COMMON + register::common::GATEWAY, &address)?;
|
||||
current.gateway = settings.gateway;
|
||||
}
|
||||
if settings.subnet != current.subnet {
|
||||
let address = settings.subnet.octets();
|
||||
bus.write_frame(register::COMMON, register::common::SUBNET_MASK, &address)?;
|
||||
bus.write_frame(register::COMMON + register::common::SUBNET_MASK, &address)?;
|
||||
current.subnet = settings.subnet;
|
||||
}
|
||||
if settings.mac != current.mac {
|
||||
let address = settings.mac.octets;
|
||||
bus.write_frame(register::COMMON, register::common::MAC, &address)?;
|
||||
bus.write_frame(register::COMMON + register::common::MAC, &address)?;
|
||||
current.mac = settings.mac;
|
||||
}
|
||||
if settings.ip != current.ip {
|
||||
let address = settings.ip.octets();
|
||||
bus.write_frame(register::COMMON, register::common::IP, &address)?;
|
||||
bus.write_frame(register::COMMON + register::common::IP, &address)?;
|
||||
current.ip = settings.ip;
|
||||
}
|
||||
Ok(())
|
||||
|
|
|
|||
50
src/lib.rs
50
src/lib.rs
|
|
@ -17,7 +17,7 @@ mod uninitialized_device;
|
|||
|
||||
#[doc(inline)]
|
||||
pub use self::{
|
||||
device::Device,
|
||||
device::{Device, DeviceState},
|
||||
host::{Dhcp, Host, HostConfig, Manual},
|
||||
net::MacAddress,
|
||||
uninitialized_device::{InitializeError, UninitializedDevice},
|
||||
|
|
@ -25,15 +25,6 @@ pub use self::{
|
|||
|
||||
// TODO add better docs to all public items, add unit tests.
|
||||
|
||||
/// Settings for wake on LAN. Allows the W5500 to optionally emit an interrupt upon receiving a packet
|
||||
#[repr(u8)]
|
||||
#[derive(Copy, Clone, Debug, PartialOrd, PartialEq, Eq)]
|
||||
#[cfg_attr(feature = "defmt", derive(defmt::Format))]
|
||||
pub enum OnWakeOnLan {
|
||||
InvokeInterrupt = 0b00100000,
|
||||
Ignore = 0b00000000,
|
||||
}
|
||||
|
||||
/// Ping Block Mode
|
||||
///
|
||||
/// Settings for ping. Allows the W5500 to respond to or ignore network ping requests
|
||||
|
|
@ -59,28 +50,11 @@ pub enum ConnectionType {
|
|||
Ethernet = 0b00000000,
|
||||
}
|
||||
|
||||
/// Force ARP
|
||||
///
|
||||
#[derive(Copy, Clone, Debug, PartialOrd, PartialEq, Eq)]
|
||||
#[cfg_attr(feature = "defmt", derive(defmt::Format))]
|
||||
#[repr(u8)]
|
||||
pub enum ArpResponses {
|
||||
/// 0 : Disable Force ARP mode
|
||||
Cache = 0b00000000,
|
||||
/// 1 : Enable Force ARP mode
|
||||
///
|
||||
/// In Force ARP mode, It forces on sending ARP Request whenever data is
|
||||
/// sent.
|
||||
DropAfterUse = 0b00000010,
|
||||
}
|
||||
|
||||
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
|
||||
#[cfg_attr(feature = "defmt", derive(defmt::Format))]
|
||||
pub struct Mode {
|
||||
pub on_wake_on_lan: OnWakeOnLan,
|
||||
pub on_ping_request: OnPingRequest,
|
||||
pub connection_type: ConnectionType,
|
||||
pub arp_responses: ArpResponses,
|
||||
}
|
||||
|
||||
impl Mode {
|
||||
|
|
@ -90,10 +64,8 @@ impl Mode {
|
|||
|
||||
pub fn to_u8(self) -> u8 {
|
||||
let mut register = 0;
|
||||
register |= self.on_wake_on_lan as u8;
|
||||
register |= self.on_ping_request as u8;
|
||||
register |= self.connection_type as u8;
|
||||
register |= self.arp_responses as u8;
|
||||
|
||||
register
|
||||
}
|
||||
|
|
@ -102,10 +74,8 @@ impl Mode {
|
|||
impl Default for Mode {
|
||||
fn default() -> Self {
|
||||
Self {
|
||||
on_wake_on_lan: OnWakeOnLan::Ignore,
|
||||
on_ping_request: OnPingRequest::Respond,
|
||||
connection_type: ConnectionType::Ethernet,
|
||||
arp_responses: ArpResponses::DropAfterUse,
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -119,33 +89,29 @@ mod test {
|
|||
let ping_respond_and_force_arp = Mode {
|
||||
// Bit: 7 Reset (RST) should be 0
|
||||
// Bit: 6 reserved
|
||||
// Bit: 5 should be 0 - Disable WOL mode
|
||||
on_wake_on_lan: crate::OnWakeOnLan::Ignore,
|
||||
// Bit: 5 reserved
|
||||
// Bit: 4 should be 0 - Disable Ping Block Mode
|
||||
on_ping_request: crate::OnPingRequest::Respond,
|
||||
// Bit: 3 should be 0 - PPoE disabled
|
||||
connection_type: crate::ConnectionType::Ethernet,
|
||||
// Bit: 2 reserved
|
||||
// Bit: 1 should be 0 - Disabled Force ARP
|
||||
arp_responses: crate::ArpResponses::Cache,
|
||||
// Bit: 0 reserved
|
||||
// Bit: 1 address auto-increment should be 0
|
||||
// Bit: 0 indirect bus I/F mode should be 0
|
||||
};
|
||||
assert_eq!(0b0000_0000, ping_respond_and_force_arp.to_u8());
|
||||
|
||||
let all_enabled = Mode {
|
||||
// Bit: 7 Reset (RST) should be 0
|
||||
// Bit: 6 reserved
|
||||
// Bit: 5 should be 1 - Enable WOL mode
|
||||
on_wake_on_lan: crate::OnWakeOnLan::InvokeInterrupt,
|
||||
// Bit: 5 reserved
|
||||
// Bit: 4 should be 0 - Disable Ping Block Mode
|
||||
on_ping_request: crate::OnPingRequest::Respond,
|
||||
// Bit: 3 should be 1 - PPoE enable
|
||||
connection_type: crate::ConnectionType::PPoE,
|
||||
// Bit: 2 reserved
|
||||
// Bit: 1 should be 1 - Enable Force ARP
|
||||
arp_responses: crate::ArpResponses::DropAfterUse,
|
||||
// Bit: 0 reserved
|
||||
// Bit: 1 address auto-increment should be 0
|
||||
// Bit: 0 indirect bus I/F mode should be 0
|
||||
};
|
||||
assert_eq!(0b0010_1010, all_enabled.to_u8());
|
||||
assert_eq!(0b0000_1000, all_enabled.to_u8());
|
||||
}
|
||||
}
|
||||
|
|
|
|||
|
|
@ -12,7 +12,7 @@
|
|||
|
||||
// TODO remove some of these constructs and use equivalents available from embedded-nal
|
||||
|
||||
pub use embedded_nal::Ipv4Addr;
|
||||
pub use core::net::Ipv4Addr;
|
||||
|
||||
/// MAC address struct. Can be instantiated with `MacAddress::new`.
|
||||
///
|
||||
|
|
|
|||
|
|
@ -19,38 +19,22 @@ impl<SpiBus: Bus> RawDevice<SpiBus> {
|
|||
pub(crate) fn new(mut bus: SpiBus) -> Result<Self, InitializeError<SpiBus::Error>> {
|
||||
// Set the raw socket to 16KB RX/TX buffer space.
|
||||
let raw_socket = Socket::new(0);
|
||||
bus.write_frame(raw_socket.register(), register::socketn::TXBUF_SIZE, &[16])?;
|
||||
bus.write_frame(raw_socket.register(), register::socketn::RXBUF_SIZE, &[16])?;
|
||||
|
||||
// Set all socket buffers to 0KB size.
|
||||
for socket_index in 1..8 {
|
||||
let socket = Socket::new(socket_index);
|
||||
bus.write_frame(socket.register(), register::socketn::TXBUF_SIZE, &[0])?;
|
||||
bus.write_frame(socket.register(), register::socketn::RXBUF_SIZE, &[0])?;
|
||||
}
|
||||
|
||||
// Configure the chip in MACRAW mode with MAC filtering.
|
||||
let mode: u8 = (1 << 7) | // MAC address filtering
|
||||
let mode: u8 = (1 << 6) | // MAC address filtering
|
||||
(register::socketn::Protocol::MacRaw as u8);
|
||||
|
||||
bus.write_frame(raw_socket.register(), register::socketn::MODE, &[mode])?;
|
||||
bus.write_frame(raw_socket.register() + register::socketn::MODE, &[mode])?;
|
||||
raw_socket.command(&mut bus, register::socketn::Command::Open)?;
|
||||
|
||||
Ok(Self { bus, raw_socket })
|
||||
}
|
||||
|
||||
/// Enable one or more interrupts
|
||||
///
|
||||
/// # Args
|
||||
/// * `which` - The interrupts to enable; see `register::socketn::Interrupt`
|
||||
/// For instance, pass `Interrupt::Receive` to get interrupts
|
||||
/// on packet reception only.
|
||||
///
|
||||
pub fn enable_interrupts(&mut self, which: u8) -> Result<(), SpiBus::Error> {
|
||||
self.raw_socket.set_interrupt_mask(&mut self.bus, which)?;
|
||||
pub fn enable_interrupts(&mut self) -> Result<(), SpiBus::Error> {
|
||||
self.bus.write_frame(
|
||||
register::COMMON,
|
||||
register::common::SOCKET_INTERRUPT_MASK,
|
||||
register::COMMON +
|
||||
register::common::INTERRUPT_MASK,
|
||||
&[1],
|
||||
)?;
|
||||
Ok(())
|
||||
|
|
@ -73,11 +57,10 @@ impl<SpiBus: Bus> RawDevice<SpiBus> {
|
|||
///
|
||||
pub fn disable_interrupts(&mut self) -> Result<(), SpiBus::Error> {
|
||||
self.bus.write_frame(
|
||||
register::COMMON,
|
||||
register::common::SOCKET_INTERRUPT_MASK,
|
||||
register::COMMON +
|
||||
register::common::INTERRUPT_MASK,
|
||||
&[0],
|
||||
)?;
|
||||
self.raw_socket.set_interrupt_mask(&mut self.bus, 0xFF)?;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
|
|
|
|||
200
src/register.rs
200
src/register.rs
|
|
@ -1,7 +1,7 @@
|
|||
#![allow(clippy::inconsistent_digit_grouping, clippy::unusual_byte_groupings)]
|
||||
|
||||
// TODO change from u8 to a custom struct implementing a trait.
|
||||
pub const COMMON: u8 = 0;
|
||||
pub const COMMON: u16 = 0;
|
||||
pub mod common {
|
||||
use bit_field::BitArray;
|
||||
|
||||
|
|
@ -19,20 +19,20 @@ pub mod common {
|
|||
/// Register: SIPR (Source IP Address Register) [R/W] [0x000F – 0x0012] [0x00]
|
||||
pub const IP: u16 = 0x0F;
|
||||
|
||||
/// Register: INTLEVEL (Interrupt Low Level Timer Register) [R/W] [0x0013 – 0x0014] [0x0000]
|
||||
pub const INTERRUPT_TIMER: u16 = 0x13;
|
||||
|
||||
/// Register: SIMR (Socket Interrupt Mask Register) [R/W] [0x0018] [0x00]
|
||||
pub const SOCKET_INTERRUPT_MASK: u16 = 0x18;
|
||||
/// Register: IMR (Interrupt Mask Register) [R/W] [0x0016 – 0x001A] [0x07D0]
|
||||
pub const INTERRUPT_MASK: u16 = 0x16;
|
||||
|
||||
/// Register: RTR (Retry Time-value Register) [R/W] [0x0019 – 0x001A] [0x07D0]
|
||||
pub const RETRY_TIME: u16 = 0x19;
|
||||
pub const RETRY_TIME: u16 = 0x17;
|
||||
|
||||
/// Register: RCR (Retry Count Register) [R/W] [0x001B] [0x08]
|
||||
pub const RETRY_COUNT: u16 = 0x1B;
|
||||
pub const RETRY_COUNT: u16 = 0x19;
|
||||
|
||||
pub const PHY_CONFIG: u16 = 0x2E;
|
||||
pub const VERSION: u16 = 0x39;
|
||||
/// Register: RCR (Retry Count Register) [R/W] [0x001B] [0x08]
|
||||
pub const RX_MEMORY_SIZE: u16 = 0x1A;
|
||||
|
||||
/// Register: RCR (Retry Count Register) [R/W] [0x001B] [0x08]
|
||||
pub const TX_MEMORY_SIZE: u16 = 0x1B;
|
||||
|
||||
/// A Retry Time-value
|
||||
///
|
||||
|
|
@ -86,147 +86,8 @@ pub mod common {
|
|||
Self::from_millis(200)
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Default, Debug, Copy, Clone, Eq, PartialEq, Ord, PartialOrd)]
|
||||
#[repr(u8)]
|
||||
pub enum PhyOperationMode {
|
||||
/// 10BT half-duplex. Auto-negotiation disabled.
|
||||
HalfDuplex10bt = 0b000_000,
|
||||
/// 10BT full-duplex. Auto-negotiation disabled.
|
||||
FullDuplex10bt = 0b001_000,
|
||||
/// 100BT half-duplex. Auto-negotiation disabled.
|
||||
HalfDuplex100bt = 0b010_000,
|
||||
/// 100BT full-duplex. Auto-negotiation disabled.
|
||||
FullDuplex100bt = 0b011_000,
|
||||
/// 100BT half-duplex. Auto-negotiation enabled.
|
||||
HalfDuplex100btAuto = 0b100_000,
|
||||
/// Power down mode.
|
||||
PowerDown = 0b110_000,
|
||||
/// All capable. Auto-negotiation enabled.
|
||||
#[default]
|
||||
Auto = 0b111_000,
|
||||
}
|
||||
|
||||
impl From<PhyOperationMode> for u8 {
|
||||
fn from(val: PhyOperationMode) -> u8 {
|
||||
val as u8
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Debug, Copy, Clone, Eq, PartialEq, Ord, PartialOrd)]
|
||||
#[repr(u8)]
|
||||
pub enum PhySpeedStatus {
|
||||
/// 10Mbps based.
|
||||
Mbps10 = 0,
|
||||
/// 100Mbps based.
|
||||
Mbps100 = 1,
|
||||
}
|
||||
|
||||
#[derive(Debug, Copy, Clone, Eq, PartialEq, Ord, PartialOrd)]
|
||||
#[repr(u8)]
|
||||
pub enum PhyDuplexStatus {
|
||||
/// Half duplex.
|
||||
HalfDuplex = 0,
|
||||
/// Full duplex.
|
||||
FullDuplex = 1,
|
||||
}
|
||||
|
||||
#[derive(Debug, Copy, Clone, Eq, PartialEq)]
|
||||
pub struct PhyConfig([u8; 1]);
|
||||
|
||||
impl PhyConfig {
|
||||
// Link status bit position.
|
||||
const LNK_POS: usize = 0;
|
||||
// Speed status bit position.
|
||||
const SPD_POS: usize = 1;
|
||||
// Duplex status bit position.
|
||||
const DPX_POS: usize = 2;
|
||||
// Operation mode bit position.
|
||||
// const OPMDC_POS = 3;
|
||||
// Configure PHY opeartion mode bit position.
|
||||
// const OPMD_POS = 6;
|
||||
// Reset bit position.
|
||||
// const RST_POS = 7;
|
||||
|
||||
/// PHY link status.
|
||||
///
|
||||
/// `true` if the link is up, `false` if the link is down.
|
||||
pub fn link_up(&self) -> bool {
|
||||
self.0.get_bit(Self::LNK_POS)
|
||||
}
|
||||
|
||||
/// PHY speed status.
|
||||
pub fn speed(&self) -> PhySpeedStatus {
|
||||
if !self.0.get_bit(Self::SPD_POS) {
|
||||
PhySpeedStatus::Mbps10
|
||||
} else {
|
||||
PhySpeedStatus::Mbps100
|
||||
}
|
||||
}
|
||||
|
||||
/// PHY duplex status.
|
||||
pub fn duplex(&self) -> PhyDuplexStatus {
|
||||
if !self.0.get_bit(Self::DPX_POS) {
|
||||
PhyDuplexStatus::HalfDuplex
|
||||
} else {
|
||||
PhyDuplexStatus::FullDuplex
|
||||
}
|
||||
}
|
||||
|
||||
/// PHY operation mode.
|
||||
pub fn operation_mode(&self) -> PhyOperationMode {
|
||||
match self.0[0] & 0b111_000u8 {
|
||||
0b000_000 => PhyOperationMode::HalfDuplex10bt,
|
||||
0b001_000 => PhyOperationMode::FullDuplex10bt,
|
||||
0b010_000 => PhyOperationMode::HalfDuplex100bt,
|
||||
0b011_000 => PhyOperationMode::FullDuplex100bt,
|
||||
0b100_000 => PhyOperationMode::HalfDuplex100btAuto,
|
||||
0b110_000 => PhyOperationMode::PowerDown,
|
||||
0b111_000 => PhyOperationMode::Auto,
|
||||
_ => unreachable!(),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl core::convert::From<u8> for PhyConfig {
|
||||
fn from(val: u8) -> Self {
|
||||
PhyConfig([val])
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
pub const SOCKET0: u8 = 0b000_00001;
|
||||
pub const SOCKET0_BUFFER_TX: u8 = 0b000_00010;
|
||||
pub const SOCKET0_BUFFER_RX: u8 = 0b000_00011;
|
||||
|
||||
pub const SOCKET1: u8 = 0b000_00101;
|
||||
pub const SOCKET1_BUFFER_TX: u8 = 0b000_00110;
|
||||
pub const SOCKET1_BUFFER_RX: u8 = 0b000_00111;
|
||||
|
||||
pub const SOCKET2: u8 = 0b000_01001;
|
||||
pub const SOCKET2_BUFFER_TX: u8 = 0b000_01010;
|
||||
pub const SOCKET2_BUFFER_RX: u8 = 0b000_01011;
|
||||
|
||||
pub const SOCKET3: u8 = 0b000_01101;
|
||||
pub const SOCKET3_BUFFER_TX: u8 = 0b000_01110;
|
||||
pub const SOCKET3_BUFFER_RX: u8 = 0b000_01111;
|
||||
|
||||
pub const SOCKET4: u8 = 0b000_10001;
|
||||
pub const SOCKET4_BUFFER_TX: u8 = 0b000_10010;
|
||||
pub const SOCKET4_BUFFER_RX: u8 = 0b000_10011;
|
||||
|
||||
pub const SOCKET5: u8 = 0b000_10101;
|
||||
pub const SOCKET5_BUFFER_TX: u8 = 0b000_10110;
|
||||
pub const SOCKET5_BUFFER_RX: u8 = 0b000_10111;
|
||||
|
||||
pub const SOCKET6: u8 = 0b000_11001;
|
||||
pub const SOCKET6_BUFFER_TX: u8 = 0b000_11010;
|
||||
pub const SOCKET6_BUFFER_RX: u8 = 0b000_11011;
|
||||
|
||||
pub const SOCKET7: u8 = 0b000_11101;
|
||||
pub const SOCKET7_BUFFER_TX: u8 = 0b000_11110;
|
||||
pub const SOCKET7_BUFFER_RX: u8 = 0b000_11111;
|
||||
|
||||
pub mod socketn {
|
||||
use derive_try_from_primitive::TryFromPrimitive;
|
||||
|
||||
|
|
@ -239,7 +100,9 @@ pub mod socketn {
|
|||
Closed = 0b00,
|
||||
Tcp = 0b01,
|
||||
Udp = 0b10,
|
||||
IpRaw = 0b11,
|
||||
MacRaw = 0b100,
|
||||
PPoE = 0b101,
|
||||
}
|
||||
|
||||
/// Socket n Command Register
|
||||
|
|
@ -287,7 +150,7 @@ pub mod socketn {
|
|||
/// | 0 | CON | Sn_IR(CON) | Interrupt Mask |
|
||||
#[repr(u8)]
|
||||
pub enum Interrupt {
|
||||
All = 0b11111111u8,
|
||||
All = 0b11111u8,
|
||||
SendOk = 0b10000u8,
|
||||
Timeout = 0b1000u8,
|
||||
|
||||
|
|
@ -339,7 +202,9 @@ pub mod socketn {
|
|||
Established = 0x17,
|
||||
CloseWait = 0x1c,
|
||||
Udp = 0x22,
|
||||
IpRaw = 0x32,
|
||||
MacRaw = 0x42,
|
||||
PPoE = 0x5f,
|
||||
|
||||
// Transient states.
|
||||
SynSent = 0x15,
|
||||
|
|
@ -348,6 +213,7 @@ pub mod socketn {
|
|||
Closing = 0x1a,
|
||||
TimeWait = 0x1b,
|
||||
LastAck = 0x1d,
|
||||
Arp = 0x01,
|
||||
}
|
||||
|
||||
#[cfg(feature = "defmt")]
|
||||
|
|
@ -369,22 +235,6 @@ pub mod socketn {
|
|||
|
||||
pub const DESTINATION_PORT: u16 = 0x10;
|
||||
|
||||
pub const RXBUF_SIZE: u16 = 0x1E;
|
||||
|
||||
/// Socket n TX Buffer Size Register
|
||||
///
|
||||
/// `Sn_TXBUF_SIZE`
|
||||
///
|
||||
/// From datasheet:
|
||||
///
|
||||
/// > .. can be configured with 1,2,4,8, and 16 Kbytes.
|
||||
/// >
|
||||
/// > Although Socket n TX Buffer Block size is initially configured to 2Kbytes, user can
|
||||
/// > be re-configure its size using Sn_TXBUF_SIZE. The total sum of Sn_TXBUF_SIZE
|
||||
/// > cannot be exceed 16Kbytes. When exceeded, the data transmission error is
|
||||
/// > occurred.
|
||||
pub const TXBUF_SIZE: u16 = 0x1F;
|
||||
|
||||
/// TX Free Size Register
|
||||
///
|
||||
/// `Sn_TX_FSR`
|
||||
|
|
@ -418,14 +268,14 @@ pub mod socketn {
|
|||
/// > It should be read or to be updated like as follows.
|
||||
/// > 1. Read the starting address for saving the transmitting data.
|
||||
/// > 2. Save the transmitting data from the starting address of Socket n TX
|
||||
/// > buffer.
|
||||
/// > buffer.
|
||||
/// > 3. After saving the transmitting data, update Sn_TX_WR to the
|
||||
/// > increased value as many as transmitting data size. If the increment value
|
||||
/// > exceeds the maximum value 0xFFFF(greater than 0x10000 and the carry
|
||||
/// > bit occurs), then the carry bit is ignored and will automatically update
|
||||
/// > with the lower 16bits value.
|
||||
/// > increased value as many as transmitting data size. If the increment value
|
||||
/// > exceeds the maximum value 0xFFFF(greater than 0x10000 and the carry
|
||||
/// > bit occurs), then the carry bit is ignored and will automatically update
|
||||
/// > with the lower 16bits value.
|
||||
/// > 4. Transmit the saved data in Socket n TX Buffer by using SEND/SEND
|
||||
/// command
|
||||
/// > command
|
||||
pub const TX_DATA_WRITE_POINTER: u16 = 0x24;
|
||||
|
||||
/// Socket n Received Size Register
|
||||
|
|
@ -435,12 +285,6 @@ pub mod socketn {
|
|||
|
||||
pub const RX_DATA_READ_POINTER: u16 = 0x28;
|
||||
|
||||
/// Socket n Interrupt Mask
|
||||
///
|
||||
/// offset (register)
|
||||
/// 0x002C (Sn_IMR)
|
||||
pub const INTERRUPT_MASK: u16 = 0x2C;
|
||||
|
||||
#[cfg(test)]
|
||||
mod tests {
|
||||
use core::convert::TryFrom;
|
||||
|
|
|
|||
193
src/socket.rs
193
src/socket.rs
|
|
@ -1,46 +1,25 @@
|
|||
use core::convert::TryFrom;
|
||||
use core::net::Ipv4Addr;
|
||||
|
||||
use crate::bus::Bus;
|
||||
use crate::register::socketn;
|
||||
use embedded_nal::Ipv4Addr;
|
||||
use crate::register::{self, socketn};
|
||||
|
||||
#[derive(Debug)]
|
||||
#[cfg_attr(feature = "defmt", derive(defmt::Format))]
|
||||
pub struct Socket {
|
||||
pub index: u8,
|
||||
register: u8,
|
||||
tx_buffer: u8,
|
||||
rx_buffer: u8,
|
||||
}
|
||||
|
||||
impl Socket {
|
||||
/// 8 sockets available on the w5500
|
||||
/// 4 sockets available on the w5100
|
||||
pub fn new(index: u8) -> Self {
|
||||
/*
|
||||
* Socket 0 is at address 0x01
|
||||
* Socket 0 TX is at address 0x02
|
||||
* Socket 0 RX is at address 0x03
|
||||
* skip 0x04
|
||||
* Socket 1 is at address 0x05
|
||||
* Socket 1 TX is at address 0x06
|
||||
* Socket 1 RX is at address 0x07
|
||||
* ...
|
||||
*/
|
||||
let block = index * 4;
|
||||
Socket {
|
||||
index,
|
||||
register: block + 1,
|
||||
tx_buffer: block + 2,
|
||||
rx_buffer: block + 3,
|
||||
}
|
||||
}
|
||||
|
||||
pub fn register(&self) -> u8 {
|
||||
self.register
|
||||
}
|
||||
pub fn tx_buffer(&self) -> u8 {
|
||||
self.tx_buffer
|
||||
}
|
||||
pub fn rx_buffer(&self) -> u8 {
|
||||
self.rx_buffer
|
||||
pub fn register(&self) -> u16 {
|
||||
self.index as u16 * 0x100 + 0x400
|
||||
}
|
||||
|
||||
pub fn set_mode<SpiBus: Bus>(
|
||||
|
|
@ -49,13 +28,22 @@ impl Socket {
|
|||
mode: socketn::Protocol,
|
||||
) -> Result<(), SpiBus::Error> {
|
||||
let mode = [mode as u8];
|
||||
bus.write_frame(self.register(), socketn::MODE, &mode)?;
|
||||
bus.write_frame(self.register() + socketn::MODE, &mode)?;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
pub fn get_mode<SpiBus: Bus>(
|
||||
&self,
|
||||
bus: &mut SpiBus,
|
||||
) -> Result<u8, SpiBus::Error> {
|
||||
let mut mode = [0];
|
||||
bus.write_frame(self.register() + socketn::MODE, &mut mode)?;
|
||||
Ok(mode[0])
|
||||
}
|
||||
|
||||
pub fn get_status<SpiBus: Bus>(&self, bus: &mut SpiBus) -> Result<u8, SpiBus::Error> {
|
||||
let mut data = [0u8];
|
||||
bus.read_frame(self.register(), socketn::STATUS, &mut data)?;
|
||||
bus.read_frame(self.register() + socketn::STATUS, &mut data)?;
|
||||
Ok(data[0])
|
||||
}
|
||||
|
||||
|
|
@ -65,7 +53,7 @@ impl Socket {
|
|||
code: socketn::Interrupt,
|
||||
) -> Result<(), SpiBus::Error> {
|
||||
let data = [code as u8];
|
||||
bus.write_frame(self.register(), socketn::INTERRUPT, &data)?;
|
||||
bus.write_frame(self.register() + socketn::INTERRUPT, &data)?;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
|
|
@ -75,7 +63,7 @@ impl Socket {
|
|||
code: socketn::Interrupt,
|
||||
) -> Result<bool, SpiBus::Error> {
|
||||
let mut data = [0u8];
|
||||
bus.read_frame(self.register(), socketn::INTERRUPT, &mut data)?;
|
||||
bus.read_frame(self.register() + socketn::INTERRUPT, &mut data)?;
|
||||
|
||||
Ok(data[0] & code as u8 != 0)
|
||||
}
|
||||
|
|
@ -86,17 +74,26 @@ impl Socket {
|
|||
port: u16,
|
||||
) -> Result<(), SpiBus::Error> {
|
||||
let data = port.to_be_bytes();
|
||||
bus.write_frame(self.register(), socketn::SOURCE_PORT, &data)?;
|
||||
bus.write_frame(self.register() + socketn::SOURCE_PORT, &data)?;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
pub fn get_source_port<SpiBus: Bus>(
|
||||
&self,
|
||||
bus: &mut SpiBus,
|
||||
) -> Result<u16, SpiBus::Error> {
|
||||
let mut data = [0; 2];
|
||||
bus.read_frame(self.register() + socketn::SOURCE_PORT, &mut data)?;
|
||||
Ok(u16::from_be_bytes(data))
|
||||
}
|
||||
|
||||
pub fn set_destination_ip<SpiBus: Bus>(
|
||||
&self,
|
||||
bus: &mut SpiBus,
|
||||
ip: Ipv4Addr,
|
||||
) -> Result<(), SpiBus::Error> {
|
||||
let data = ip.octets();
|
||||
bus.write_frame(self.register(), socketn::DESTINATION_IP, &data)?;
|
||||
bus.write_frame(self.register() + socketn::DESTINATION_IP, &data)?;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
|
|
@ -106,13 +103,13 @@ impl Socket {
|
|||
port: u16,
|
||||
) -> Result<(), SpiBus::Error> {
|
||||
let data = port.to_be_bytes();
|
||||
bus.write_frame(self.register(), socketn::DESTINATION_PORT, &data)?;
|
||||
bus.write_frame(self.register() + socketn::DESTINATION_PORT, &data)?;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
pub fn get_tx_read_pointer<SpiBus: Bus>(&self, bus: &mut SpiBus) -> Result<u16, SpiBus::Error> {
|
||||
let mut data = [0u8; 2];
|
||||
bus.read_frame(self.register(), socketn::TX_DATA_READ_POINTER, &mut data)?;
|
||||
bus.read_frame(self.register() + socketn::TX_DATA_READ_POINTER, &mut data)?;
|
||||
Ok(u16::from_be_bytes(data))
|
||||
}
|
||||
|
||||
|
|
@ -122,7 +119,7 @@ impl Socket {
|
|||
pointer: u16,
|
||||
) -> Result<(), SpiBus::Error> {
|
||||
let data = pointer.to_be_bytes();
|
||||
bus.write_frame(self.register(), socketn::TX_DATA_READ_POINTER, &data)?;
|
||||
bus.write_frame(self.register() + socketn::TX_DATA_READ_POINTER, &data)?;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
|
|
@ -131,7 +128,7 @@ impl Socket {
|
|||
bus: &mut SpiBus,
|
||||
) -> Result<u16, SpiBus::Error> {
|
||||
let mut data = [0u8; 2];
|
||||
bus.read_frame(self.register(), socketn::TX_DATA_WRITE_POINTER, &mut data)?;
|
||||
bus.read_frame(self.register() + socketn::TX_DATA_WRITE_POINTER, &mut data)?;
|
||||
Ok(u16::from_be_bytes(data))
|
||||
}
|
||||
|
||||
|
|
@ -141,13 +138,13 @@ impl Socket {
|
|||
pointer: u16,
|
||||
) -> Result<(), SpiBus::Error> {
|
||||
let data = pointer.to_be_bytes();
|
||||
bus.write_frame(self.register(), socketn::TX_DATA_WRITE_POINTER, &data)?;
|
||||
bus.write_frame(self.register() + socketn::TX_DATA_WRITE_POINTER, &data)?;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
pub fn get_rx_read_pointer<SpiBus: Bus>(&self, bus: &mut SpiBus) -> Result<u16, SpiBus::Error> {
|
||||
let mut data = [0u8; 2];
|
||||
bus.read_frame(self.register(), socketn::RX_DATA_READ_POINTER, &mut data)?;
|
||||
bus.read_frame(self.register() + socketn::RX_DATA_READ_POINTER, &mut data)?;
|
||||
Ok(u16::from_be_bytes(data))
|
||||
}
|
||||
|
||||
|
|
@ -157,19 +154,31 @@ impl Socket {
|
|||
pointer: u16,
|
||||
) -> Result<(), SpiBus::Error> {
|
||||
let data = pointer.to_be_bytes();
|
||||
bus.write_frame(self.register(), socketn::RX_DATA_READ_POINTER, &data)?;
|
||||
bus.write_frame(self.register() + socketn::RX_DATA_READ_POINTER, &data)?;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
pub fn set_interrupt_mask<SpiBus: Bus>(
|
||||
pub fn enable_interrupts<SpiBus: Bus>(
|
||||
&self,
|
||||
bus: &mut SpiBus,
|
||||
mask: u8,
|
||||
) -> Result<(), SpiBus::Error> {
|
||||
let data = [mask];
|
||||
bus.write_frame(self.register(), socketn::INTERRUPT_MASK, &data)?;
|
||||
Ok(())
|
||||
}
|
||||
let mut data = [0];
|
||||
bus.read_frame(register::COMMON + register::common::INTERRUPT_MASK, &mut data)?;
|
||||
data[0] |= 1 << self.index;
|
||||
bus.write_frame(register::COMMON + register::common::INTERRUPT_MASK, &data)?;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
pub fn disable_interrupts<SpiBus: Bus>(
|
||||
&self,
|
||||
bus: &mut SpiBus,
|
||||
) -> Result<(), SpiBus::Error> {
|
||||
let mut data = [0];
|
||||
bus.read_frame(register::COMMON + register::common::INTERRUPT_MASK, &mut data)?;
|
||||
data[0] &= !(1 << self.index);
|
||||
bus.write_frame(register::COMMON + register::common::INTERRUPT_MASK, &data)?;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
pub fn command<SpiBus: Bus>(
|
||||
&self,
|
||||
|
|
@ -177,7 +186,7 @@ impl Socket {
|
|||
command: socketn::Command,
|
||||
) -> Result<(), SpiBus::Error> {
|
||||
let data = [command as u8];
|
||||
bus.write_frame(self.register(), socketn::COMMAND, &data)?;
|
||||
bus.write_frame(self.register() + socketn::COMMAND, &data)?;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
|
|
@ -187,9 +196,9 @@ impl Socket {
|
|||
pub fn get_receive_size<SpiBus: Bus>(&self, bus: &mut SpiBus) -> Result<u16, SpiBus::Error> {
|
||||
loop {
|
||||
let mut sample_0 = [0u8; 2];
|
||||
bus.read_frame(self.register(), socketn::RECEIVED_SIZE, &mut sample_0)?;
|
||||
bus.read_frame(self.register() + socketn::RECEIVED_SIZE, &mut sample_0)?;
|
||||
let mut sample_1 = [0u8; 2];
|
||||
bus.read_frame(self.register(), socketn::RECEIVED_SIZE, &mut sample_1)?;
|
||||
bus.read_frame(self.register() + socketn::RECEIVED_SIZE, &mut sample_1)?;
|
||||
if sample_0 == sample_1 {
|
||||
break Ok(u16::from_be_bytes(sample_0));
|
||||
}
|
||||
|
|
@ -201,89 +210,7 @@ impl Socket {
|
|||
/// It's cleared once we `SEND` the buffer over the socket.
|
||||
pub fn get_tx_free_size<SpiBus: Bus>(&self, bus: &mut SpiBus) -> Result<u16, SpiBus::Error> {
|
||||
let mut data = [0; 2];
|
||||
bus.read_frame(self.register(), socketn::TX_FREE_SIZE, &mut data)?;
|
||||
bus.read_frame(self.register() + socketn::TX_FREE_SIZE, &mut data)?;
|
||||
Ok(u16::from_be_bytes(data))
|
||||
}
|
||||
}
|
||||
|
||||
#[cfg(test)]
|
||||
mod test {
|
||||
use crate::register::*;
|
||||
|
||||
use super::*;
|
||||
|
||||
#[test]
|
||||
fn test_socket_registers() {
|
||||
// Socket 0
|
||||
{
|
||||
let socket_0 = Socket::new(0);
|
||||
|
||||
assert_eq!(socket_0.register, SOCKET0);
|
||||
assert_eq!(socket_0.tx_buffer, SOCKET0_BUFFER_TX);
|
||||
assert_eq!(socket_0.rx_buffer, SOCKET0_BUFFER_RX);
|
||||
}
|
||||
|
||||
// Socket 1
|
||||
{
|
||||
let socket_1 = Socket::new(1);
|
||||
|
||||
assert_eq!(socket_1.register, SOCKET1);
|
||||
assert_eq!(socket_1.tx_buffer, SOCKET1_BUFFER_TX);
|
||||
assert_eq!(socket_1.rx_buffer, SOCKET1_BUFFER_RX);
|
||||
}
|
||||
|
||||
// Socket 2
|
||||
{
|
||||
let socket_2 = Socket::new(2);
|
||||
|
||||
assert_eq!(socket_2.register, SOCKET2);
|
||||
assert_eq!(socket_2.tx_buffer, SOCKET2_BUFFER_TX);
|
||||
assert_eq!(socket_2.rx_buffer, SOCKET2_BUFFER_RX);
|
||||
}
|
||||
|
||||
// Socket 3
|
||||
{
|
||||
let socket_3 = Socket::new(3);
|
||||
|
||||
assert_eq!(socket_3.register, SOCKET3);
|
||||
assert_eq!(socket_3.tx_buffer, SOCKET3_BUFFER_TX);
|
||||
assert_eq!(socket_3.rx_buffer, SOCKET3_BUFFER_RX);
|
||||
}
|
||||
|
||||
// Socket 4
|
||||
{
|
||||
let socket_4 = Socket::new(4);
|
||||
|
||||
assert_eq!(socket_4.register, SOCKET4);
|
||||
assert_eq!(socket_4.tx_buffer, SOCKET4_BUFFER_TX);
|
||||
assert_eq!(socket_4.rx_buffer, SOCKET4_BUFFER_RX);
|
||||
}
|
||||
|
||||
// Socket 5
|
||||
{
|
||||
let socket_5 = Socket::new(5);
|
||||
|
||||
assert_eq!(socket_5.register, SOCKET5);
|
||||
assert_eq!(socket_5.tx_buffer, SOCKET5_BUFFER_TX);
|
||||
assert_eq!(socket_5.rx_buffer, SOCKET5_BUFFER_RX);
|
||||
}
|
||||
|
||||
// Socket 6
|
||||
{
|
||||
let socket_6 = Socket::new(6);
|
||||
|
||||
assert_eq!(socket_6.register, SOCKET6);
|
||||
assert_eq!(socket_6.tx_buffer, SOCKET6_BUFFER_TX);
|
||||
assert_eq!(socket_6.rx_buffer, SOCKET6_BUFFER_RX);
|
||||
}
|
||||
|
||||
// Socket 7
|
||||
{
|
||||
let socket_7 = Socket::new(7);
|
||||
|
||||
assert_eq!(socket_7.register, SOCKET7);
|
||||
assert_eq!(socket_7.tx_buffer, SOCKET7_BUFFER_TX);
|
||||
assert_eq!(socket_7.rx_buffer, SOCKET7_BUFFER_RX);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
|
|||
29
src/tcp.rs
29
src/tcp.rs
|
|
@ -1,3 +1,10 @@
|
|||
use core::{
|
||||
convert::TryFrom,
|
||||
net::{IpAddr, Ipv4Addr, SocketAddr, SocketAddrV4},
|
||||
};
|
||||
|
||||
use embedded_nal::{nb, TcpClientStack, TcpError, TcpErrorKind};
|
||||
|
||||
use crate::{
|
||||
bus::Bus,
|
||||
device::{Device, State},
|
||||
|
|
@ -5,12 +12,6 @@ use crate::{
|
|||
socket::Socket,
|
||||
};
|
||||
|
||||
use embedded_nal::{
|
||||
nb, IpAddr, Ipv4Addr, SocketAddr, SocketAddrV4, TcpClientStack, TcpError, TcpErrorKind,
|
||||
};
|
||||
|
||||
use core::convert::TryFrom;
|
||||
|
||||
#[derive(Debug)]
|
||||
#[cfg_attr(feature = "defmt", derive(defmt::Format))]
|
||||
pub enum TcpSocketError<E: core::fmt::Debug> {
|
||||
|
|
@ -47,11 +48,7 @@ impl TcpSocket {
|
|||
self.socket.command(bus, socketn::Command::Close)?;
|
||||
self.socket.reset_interrupt(bus, socketn::Interrupt::All)?;
|
||||
self.socket.set_mode(bus, socketn::Protocol::Tcp)?;
|
||||
|
||||
self.socket.set_interrupt_mask(
|
||||
bus,
|
||||
socketn::Interrupt::SendOk as u8 & socketn::Interrupt::Timeout as u8,
|
||||
)?;
|
||||
self.socket.enable_interrupts(bus)?;
|
||||
|
||||
self.socket.command(bus, socketn::Command::Open)?;
|
||||
Ok(())
|
||||
|
|
@ -65,11 +62,7 @@ impl TcpSocket {
|
|||
self.socket.reset_interrupt(bus, socketn::Interrupt::All)?;
|
||||
self.socket.set_source_port(bus, local_port)?;
|
||||
self.socket.set_mode(bus, socketn::Protocol::Tcp)?;
|
||||
|
||||
self.socket.set_interrupt_mask(
|
||||
bus,
|
||||
socketn::Interrupt::SendOk as u8 & socketn::Interrupt::Timeout as u8,
|
||||
)?;
|
||||
self.socket.enable_interrupts(bus)?;
|
||||
|
||||
self.socket.command(bus, socketn::Command::Open)?;
|
||||
Ok(())
|
||||
|
|
@ -161,7 +154,7 @@ impl TcpSocket {
|
|||
let write_pointer = self.socket.get_tx_write_pointer(bus)?;
|
||||
|
||||
// Write data into the buffer and update the writer pointer.
|
||||
bus.write_frame(self.socket.tx_buffer(), write_pointer, write_data)?;
|
||||
bus.write_frame(write_pointer, write_data)?;
|
||||
self.socket
|
||||
.set_tx_write_pointer(bus, write_pointer.wrapping_add(write_data.len() as u16))?;
|
||||
|
||||
|
|
@ -203,7 +196,7 @@ impl TcpSocket {
|
|||
|
||||
// Read from the RX ring buffer.
|
||||
let read_pointer = self.socket.get_rx_read_pointer(bus)?;
|
||||
bus.read_frame(self.socket.rx_buffer(), read_pointer, read_buffer)?;
|
||||
bus.read_frame(read_pointer, read_buffer)?;
|
||||
self.socket
|
||||
.set_rx_read_pointer(bus, read_pointer.wrapping_add(read_buffer.len() as u16))?;
|
||||
|
||||
|
|
|
|||
87
src/udp.rs
87
src/udp.rs
|
|
@ -1,6 +1,10 @@
|
|||
use core::{convert::TryFrom, fmt::Debug};
|
||||
use core::{
|
||||
convert::TryFrom,
|
||||
fmt::Debug,
|
||||
net::{IpAddr, Ipv4Addr, SocketAddr, SocketAddrV4},
|
||||
};
|
||||
|
||||
use embedded_nal::{nb, IpAddr, Ipv4Addr, SocketAddr, SocketAddrV4, UdpClientStack, UdpFullStack};
|
||||
use embedded_nal::{nb, UdpClientStack, UdpFullStack};
|
||||
|
||||
use crate::{
|
||||
bus::Bus,
|
||||
|
|
@ -79,17 +83,19 @@ impl UdpSocket {
|
|||
}
|
||||
|
||||
fn open<SpiBus: Bus>(&self, bus: &mut SpiBus) -> Result<(), SpiBus::Error> {
|
||||
self.socket.command(bus, socketn::Command::Close)?;
|
||||
self.socket.reset_interrupt(bus, socketn::Interrupt::All)?;
|
||||
self.socket.set_source_port(bus, self.port)?;
|
||||
self.socket.set_mode(bus, socketn::Protocol::Udp)?;
|
||||
self.socket.set_interrupt_mask(
|
||||
bus,
|
||||
socketn::Interrupt::SendOk as u8 & socketn::Interrupt::Timeout as u8,
|
||||
)?;
|
||||
self.socket.command(bus, socketn::Command::Open)?;
|
||||
|
||||
Ok(())
|
||||
loop {
|
||||
self.socket.command(bus, socketn::Command::Close)?;
|
||||
self.socket.reset_interrupt(bus, socketn::Interrupt::All)?;
|
||||
self.socket.set_source_port(bus, self.port)?;
|
||||
self.socket.set_mode(bus, socketn::Protocol::Udp)?;
|
||||
self.socket.enable_interrupts(
|
||||
bus
|
||||
)?;
|
||||
self.socket.command(bus, socketn::Command::Open)?;
|
||||
if self.socket.get_status(bus)? == Status::Udp as u8 {
|
||||
return Ok(())
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/// return the last set local port of the socket
|
||||
|
|
@ -97,6 +103,11 @@ impl UdpSocket {
|
|||
self.port
|
||||
}
|
||||
|
||||
/// return the last set local port of the socket
|
||||
pub fn get_port_for_real<SpiBus: Bus>(&self, bus: &mut SpiBus) -> Result<u16, SpiBus::Error> {
|
||||
self.socket.get_source_port(bus)
|
||||
}
|
||||
|
||||
pub fn set_port<SpiBus: Bus>(
|
||||
&mut self,
|
||||
bus: &mut SpiBus,
|
||||
|
|
@ -228,17 +239,21 @@ impl UdpSocket {
|
|||
&send_buffer[..(free_size as usize)]
|
||||
};
|
||||
|
||||
// Append the data to the write buffer after the current write pointer.
|
||||
let write_pointer = self.socket.get_tx_write_pointer(bus)?;
|
||||
let offset = self.socket.get_tx_write_pointer(bus)? & 0x7ff;
|
||||
let start_addr = offset + 0x4000 + 0x800 * self.socket.index as u16;
|
||||
|
||||
// Write data into the buffer and update the writer pointer.
|
||||
bus.write_frame(self.socket.tx_buffer(), write_pointer, write_data)?;
|
||||
// this will wrap the pointer accordingly to the TX `free_size`.
|
||||
// safe to cast to `u16` because the maximum buffer size in w5500 is 16 KB!
|
||||
let new_write_pointer = write_pointer.wrapping_add(write_data.len() as u16);
|
||||
self.socket.set_tx_write_pointer(bus, new_write_pointer)?;
|
||||
if offset as usize + write_data.len() > 0x800 {
|
||||
let upper_size = 0x800 - offset as usize;
|
||||
bus.write_frame(start_addr, &write_data[0..upper_size])?;
|
||||
bus.write_frame(0x4000 + 0x800 * self.socket.index as u16, &write_data[upper_size..])?;
|
||||
} else {
|
||||
bus.write_frame(start_addr, write_data)?;
|
||||
}
|
||||
|
||||
self.socket.set_tx_write_pointer(bus, offset.wrapping_add(write_data.len() as u16))?;
|
||||
|
||||
self.block_send_command(bus)?;
|
||||
self.socket.reset_interrupt(bus, socketn::Interrupt::SendOk);
|
||||
|
||||
Ok(write_data.len())
|
||||
}
|
||||
|
|
@ -329,12 +344,12 @@ impl UdpSocket {
|
|||
Err(err) => return Err(NbError::Other(UdpSocketError::UnrecognisedStatus)),
|
||||
}
|
||||
|
||||
if !self
|
||||
/*if !self
|
||||
.socket
|
||||
.has_interrupt(bus, socketn::Interrupt::Receive)?
|
||||
{
|
||||
return Err(NbError::WouldBlock);
|
||||
}
|
||||
}*/
|
||||
|
||||
let rx_size = self.socket.get_receive_size(bus)? as usize;
|
||||
if rx_size == 0 {
|
||||
|
|
@ -350,12 +365,12 @@ impl UdpSocket {
|
|||
// to the end (even if wrapped) of the RX buffer.
|
||||
let read_max_size = rx_size.min(buffer_size);
|
||||
|
||||
// Read from the RX ring buffer.
|
||||
let read_pointer = self.socket.get_rx_read_pointer(bus)?;
|
||||
let offset = self.socket.get_rx_read_pointer(bus)? & 0x7ff;
|
||||
let read_pointer = offset + 0x6000 + 0x800 * self.socket.index as u16;
|
||||
|
||||
let mut header = [0u8; 8];
|
||||
// read enough data for the headers - remote SocketAddr & Packet size
|
||||
bus.read_frame(self.socket.rx_buffer(), read_pointer, &mut header)?;
|
||||
bus.read_frame(read_pointer, &mut header)?;
|
||||
|
||||
let udp_header = UdpHeader::from_array(header);
|
||||
|
||||
|
|
@ -372,14 +387,14 @@ impl UdpSocket {
|
|||
let read_buffer = &mut receive_buffer[..read_length];
|
||||
|
||||
// read the rest of the packet's data that can fit in the buffer
|
||||
bus.read_frame(self.socket.rx_buffer(), data_read_pointer, read_buffer)?;
|
||||
bus.read_frame(data_read_pointer, read_buffer)?;
|
||||
|
||||
// Set the RX point after the `rx_size`, truncating any bytes that the
|
||||
// `receiving_buffer` was not able to fit
|
||||
// it's safe to cast `rx_size` to u16 as the maximum RX buffer is
|
||||
// 16 KB (`16384` maximum value) < u16::MAX
|
||||
self.socket
|
||||
.set_rx_read_pointer(bus, read_pointer.wrapping_add(rx_size as u16))?;
|
||||
.set_rx_read_pointer(bus, offset.wrapping_add(rx_size as u16))?;
|
||||
|
||||
// > RECV completes the processing of the received data in Socket n RX
|
||||
// > Buffer by using a RX read pointer register (Sn_RX_RD).
|
||||
|
|
@ -545,3 +560,19 @@ where
|
|||
Ok(())
|
||||
}
|
||||
}
|
||||
|
||||
impl<SpiBus, StateImpl> Device<SpiBus, StateImpl>
|
||||
where
|
||||
SpiBus: Bus,
|
||||
StateImpl: State,
|
||||
{
|
||||
pub fn get_port(&mut self, socket: &mut UdpSocket) -> Result<u16, UdpSocketError<SpiBus::Error>> {
|
||||
Ok(socket.get_port_for_real(&mut self.bus)?)
|
||||
}
|
||||
pub fn get_receive_size(&mut self, socket: &mut UdpSocket) -> Result<u16, UdpSocketError<SpiBus::Error>> {
|
||||
Ok(socket.socket.get_receive_size(&mut self.bus)?)
|
||||
}
|
||||
pub fn has_interrupt(&mut self, socket: &mut UdpSocket, interrupt: socketn::Interrupt) -> Result<bool, UdpSocketError<SpiBus::Error>> {
|
||||
Ok(socket.socket.has_interrupt(&mut self.bus, interrupt)?)
|
||||
}
|
||||
}
|
||||
|
|
@ -1,7 +1,8 @@
|
|||
use embedded_hal::spi::SpiDevice;
|
||||
use embedded_nal::Ipv4Addr;
|
||||
use core::net::Ipv4Addr;
|
||||
|
||||
use crate::bus::{Bus, FourWire, ThreeWire};
|
||||
use embedded_hal::spi::SpiDevice;
|
||||
|
||||
use crate::bus::{Bus, FourWire};
|
||||
use crate::device::{Device, DeviceState};
|
||||
use crate::host::{Dhcp, Host, Manual};
|
||||
use crate::raw_device::RawDevice;
|
||||
|
|
@ -92,8 +93,6 @@ impl<SpiBus: Bus> UninitializedDevice<SpiBus> {
|
|||
mut host: HostImpl,
|
||||
mode_options: Mode,
|
||||
) -> Result<Device<SpiBus, DeviceState<HostImpl>>, InitializeError<SpiBus::Error>> {
|
||||
#[cfg(not(feature = "no-chip-version-assertion"))]
|
||||
self.assert_chip_version(0x4)?;
|
||||
|
||||
// RESET
|
||||
self.reset()?;
|
||||
|
|
@ -109,10 +108,10 @@ impl<SpiBus: Bus> UninitializedDevice<SpiBus> {
|
|||
) -> Result<RawDevice<SpiBus>, InitializeError<SpiBus::Error>> {
|
||||
// Reset the device.
|
||||
self.bus
|
||||
.write_frame(register::COMMON, register::common::MODE, &[0x80])?;
|
||||
.write_frame(register::COMMON + register::common::MODE, &[0x80])?;
|
||||
|
||||
self.bus
|
||||
.write_frame(register::COMMON, register::common::MAC, &mac.octets)?;
|
||||
.write_frame(register::COMMON + register::common::MAC, &mac.octets)?;
|
||||
|
||||
RawDevice::new(self.bus)
|
||||
}
|
||||
|
|
@ -123,29 +122,17 @@ impl<SpiBus: Bus> UninitializedDevice<SpiBus> {
|
|||
// Set RST common register of the w5500
|
||||
let mode = [0b10000000];
|
||||
self.bus
|
||||
.write_frame(register::COMMON, register::common::MODE, &mode)
|
||||
.write_frame(register::COMMON + register::common::MODE, &mode)
|
||||
}
|
||||
#[inline]
|
||||
pub fn set_mode(&mut self, mode_options: Mode) -> Result<(), SpiBus::Error> {
|
||||
self.bus.write_frame(
|
||||
register::COMMON,
|
||||
register::COMMON +
|
||||
register::common::MODE,
|
||||
&mode_options.to_register(),
|
||||
)
|
||||
}
|
||||
|
||||
#[inline]
|
||||
pub fn version(&mut self) -> Result<u8, SpiBus::Error> {
|
||||
let mut version_register = [0_u8];
|
||||
self.bus.read_frame(
|
||||
register::COMMON,
|
||||
register::common::VERSION,
|
||||
&mut version_register,
|
||||
)?;
|
||||
|
||||
Ok(version_register[0])
|
||||
}
|
||||
|
||||
/// RTR (Retry Time-value Register) [R/W] [0x0019 – 0x001A] [0x07D0]
|
||||
///
|
||||
/// # Example
|
||||
|
|
@ -163,7 +150,7 @@ impl<SpiBus: Bus> UninitializedDevice<SpiBus> {
|
|||
#[inline]
|
||||
pub fn set_retry_timeout(&mut self, retry_time_value: RetryTime) -> Result<(), SpiBus::Error> {
|
||||
self.bus.write_frame(
|
||||
register::COMMON,
|
||||
register::COMMON +
|
||||
register::common::RETRY_TIME,
|
||||
&retry_time_value.to_register(),
|
||||
)?;
|
||||
|
|
@ -178,7 +165,7 @@ impl<SpiBus: Bus> UninitializedDevice<SpiBus> {
|
|||
pub fn current_retry_timeout(&mut self) -> Result<RetryTime, SpiBus::Error> {
|
||||
let mut retry_time_register: [u8; 2] = [0, 0];
|
||||
self.bus.read_frame(
|
||||
register::COMMON,
|
||||
register::COMMON+
|
||||
register::common::RETRY_TIME,
|
||||
&mut retry_time_register,
|
||||
)?;
|
||||
|
|
@ -204,7 +191,7 @@ impl<SpiBus: Bus> UninitializedDevice<SpiBus> {
|
|||
/// `RCR = 0x0007`
|
||||
pub fn set_retry_count(&mut self, retry_count: u8) -> Result<(), SpiBus::Error> {
|
||||
self.bus.write_frame(
|
||||
register::COMMON,
|
||||
register::COMMON+
|
||||
register::common::RETRY_COUNT,
|
||||
&[retry_count],
|
||||
)?;
|
||||
|
|
@ -221,25 +208,11 @@ impl<SpiBus: Bus> UninitializedDevice<SpiBus> {
|
|||
pub fn current_retry_count(&mut self) -> Result<u8, SpiBus::Error> {
|
||||
let mut retry_count_register: [u8; 1] = [0];
|
||||
self.bus.read_frame(
|
||||
register::COMMON,
|
||||
register::COMMON+
|
||||
register::common::RETRY_COUNT,
|
||||
&mut retry_count_register,
|
||||
)?;
|
||||
|
||||
Ok(retry_count_register[0])
|
||||
}
|
||||
|
||||
#[cfg(not(feature = "no-chip-version-assertion"))]
|
||||
fn assert_chip_version(
|
||||
&mut self,
|
||||
expected_version: u8,
|
||||
) -> Result<(), InitializeError<SpiBus::Error>> {
|
||||
let version = self.version()?;
|
||||
|
||||
if version != expected_version {
|
||||
Err(InitializeError::ChipNotConnected)
|
||||
} else {
|
||||
Ok(())
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue