working base
This commit is contained in:
parent
e090b70dba
commit
616c17501a
11 changed files with 1142 additions and 243 deletions
12
Cargo.lock
generated
12
Cargo.lock
generated
|
|
@ -161,6 +161,7 @@ dependencies = [
|
||||||
"realm_io",
|
"realm_io",
|
||||||
"realm_syscall",
|
"realm_syscall",
|
||||||
"regex",
|
"regex",
|
||||||
|
"sha2",
|
||||||
"sha3",
|
"sha3",
|
||||||
"static_cell",
|
"static_cell",
|
||||||
"subtle",
|
"subtle",
|
||||||
|
|
@ -322,6 +323,17 @@ version = "0.1.24"
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||||
checksum = "719b953e2095829ee67db738b3bfa9fa368c94900df327b3f07fe6e794d2fe1f"
|
checksum = "719b953e2095829ee67db738b3bfa9fa368c94900df327b3f07fe6e794d2fe1f"
|
||||||
|
|
||||||
|
[[package]]
|
||||||
|
name = "sha2"
|
||||||
|
version = "0.11.0-pre.5"
|
||||||
|
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||||
|
checksum = "19b4241d1a56954dce82cecda5c8e9c794eef6f53abe5e5216bac0a0ea71ffa7"
|
||||||
|
dependencies = [
|
||||||
|
"cfg-if",
|
||||||
|
"cpufeatures",
|
||||||
|
"digest",
|
||||||
|
]
|
||||||
|
|
||||||
[[package]]
|
[[package]]
|
||||||
name = "sha3"
|
name = "sha3"
|
||||||
version = "0.11.0-pre.5"
|
version = "0.11.0-pre.5"
|
||||||
|
|
|
||||||
|
|
@ -9,8 +9,10 @@ rand = "0.8.5"
|
||||||
realm_io = { version = "0.5" }
|
realm_io = { version = "0.5" }
|
||||||
realm_syscall = "0.1"
|
realm_syscall = "0.1"
|
||||||
regex = { version = "1.11", default-features = false, features = ["perf", "std"] }
|
regex = { version = "1.11", default-features = false, features = ["perf", "std"] }
|
||||||
|
sha2 = { version = "0.11.0-pre.5", default-features = false, features = ["std"] }
|
||||||
# TODO test feature asm on ARM
|
# TODO test feature asm on ARM
|
||||||
sha3 = { version = "0.11.0-pre.5", default-features = false, features = ["std"] }
|
sha3 = { version = "0.11.0-pre.5", default-features = false, features = ["std"] }
|
||||||
static_cell = { version = "2.1.0", features = ["nightly"] }
|
static_cell = { version = "2.1.0", features = ["nightly"] }
|
||||||
subtle = { version = "2.6.1", default-features = false, features = ["const-generics", "nightly", "std"] }
|
subtle = { version = "2.6.1", default-features = false, features = ["const-generics", "nightly", "std"] }
|
||||||
tokio = { version = "1", features = ["io-util", "macros", "rt", "rt-multi-thread", "time"] }
|
tokio = { version = "1", features = ["io-util", "macros", "rt", "rt-multi-thread", "time"] }
|
||||||
|
#to-arraystring = "0.2.2"
|
||||||
|
|
|
||||||
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/>.
|
||||||
16
README.md
16
README.md
|
|
@ -43,3 +43,19 @@ Please use it behind a safer reverse proxy like Apache or Nginx.
|
||||||
### Length-extension attack
|
### Length-extension attack
|
||||||
|
|
||||||
SHA3 (used as a MAC in the challenge cookie) is not vulnerable. Values in the hash are either fixed-length, safe, or delimited.
|
SHA3 (used as a MAC in the challenge cookie) is not vulnerable. Values in the hash are either fixed-length, safe, or delimited.
|
||||||
|
|
||||||
|
SHA2 (used for PoW) is vulnerable but nonce is at the beginning so this is not a problem.
|
||||||
|
|
||||||
|
### PoW
|
||||||
|
|
||||||
|
I would like a better PoW: memory-bound and ideally non-parallel. Cuckoo seems a good candidate.
|
||||||
|
|
||||||
|
## License
|
||||||
|
|
||||||
|
[Support me via LiberaPay](https://liberapay.com/tuxmain/donate)
|
||||||
|
|
||||||
|
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/.
|
||||||
|
|
|
||||||
|
|
@ -6,4 +6,4 @@ unstable_features = true
|
||||||
format_code_in_doc_comments = true
|
format_code_in_doc_comments = true
|
||||||
format_macro_bodies = true
|
format_macro_bodies = true
|
||||||
format_macro_matchers = true
|
format_macro_matchers = true
|
||||||
format_strings = true
|
format_strings = false
|
||||||
|
|
|
||||||
|
|
@ -8,10 +8,42 @@
|
||||||
<body>
|
<body>
|
||||||
<h1>Fighting crawlers</h1>
|
<h1>Fighting crawlers</h1>
|
||||||
<script type="text/javascript">
|
<script type="text/javascript">
|
||||||
/*setTimeout(function() {
|
const target_zeros = 15;
|
||||||
document.cookie = "mesozoa=1234; max-age=3600";
|
const sha256 = async (input) => {
|
||||||
|
const input_buf = new TextEncoder().encode(input);
|
||||||
|
const output_buf = await window.crypto.subtle.digest("SHA-256", input_buf);
|
||||||
|
return new Uint8Array(output_buf);
|
||||||
|
};
|
||||||
|
function verify_hash(hash) {
|
||||||
|
return Math.clz32((hash[0] << 24) | (hash[1] << 16) | (hash[2] << 8) | hash[3]) >= target_zeros;
|
||||||
|
}
|
||||||
|
function get_cookie(name) {
|
||||||
|
const value = "; "+document.cookie;
|
||||||
|
const parts = value.split("; "+name+"=");
|
||||||
|
return parts.pop().split(";").shift();
|
||||||
|
}
|
||||||
|
function submit_proof(proof) {
|
||||||
|
document.cookie = "mesozoa-proof="+proof+"; domain=127.0.0.1; path=/; max-age=3600; samesite=strict";
|
||||||
window.location.reload();
|
window.location.reload();
|
||||||
}, 1000);*/
|
}
|
||||||
|
function timeout(ms) {
|
||||||
|
return new Promise(resolve => setTimeout(resolve, ms));
|
||||||
|
}
|
||||||
|
async function pow(seed, nonce) {
|
||||||
|
var stop = nonce + 1000;
|
||||||
|
for(; nonce < stop; nonce ++) {
|
||||||
|
if(verify_hash(await sha256(("00000000"+nonce).slice(-8)+seed))) {
|
||||||
|
console.log(await sha256(("00000000"+nonce).slice(-8)+seed));
|
||||||
|
console.log(("00000000"+nonce).slice(-8));
|
||||||
|
submit_proof(("00000000"+nonce).slice(-8));
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
setTimeout(function() {
|
||||||
|
pow(seed, nonce);
|
||||||
|
}, 0);
|
||||||
|
}
|
||||||
|
pow(get_cookie("mesozoa-challenge"), 0);
|
||||||
</script>
|
</script>
|
||||||
</body>
|
</body>
|
||||||
</html>
|
</html>
|
||||||
|
|
|
||||||
|
|
@ -1,25 +1,40 @@
|
||||||
use base64::Engine;
|
use base64::Engine;
|
||||||
use sha3::{Digest};
|
use sha3::Digest;
|
||||||
use subtle::ConstantTimeEq;
|
use subtle::ConstantTimeEq;
|
||||||
|
|
||||||
use crate::{CHALLENGE_TIMEOUT, MAC_LEN, SALT_LEN, SECRET_LEN};
|
use crate::{CHALLENGE_TIMEOUT, MAC_LEN, SALT_LEN, SECRET_LEN};
|
||||||
|
|
||||||
pub fn check_challenge() -> bool {
|
pub fn check_challenge(seed: &[u8], proof: &[u8], target_zeros: u32) -> bool {
|
||||||
false
|
let mut hasher = sha2::Sha256::default();
|
||||||
|
hasher.update(proof);
|
||||||
|
hasher.update(seed);
|
||||||
|
let hash: [u8; 32] = hasher.finalize().into();
|
||||||
|
let prefix: [u8; 4] = hash[0..4].try_into().unwrap();
|
||||||
|
u32::from_be_bytes(prefix).leading_zeros() >= target_zeros
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn compute_challenge_mac(secret: &[u8; SECRET_LEN], salt: &[u8; SALT_LEN], timestamp: [u8; 8], ip: &[u8], user_agent: &[u8]) -> [u8; MAC_LEN] {
|
pub fn compute_challenge_mac(
|
||||||
|
secret: &[u8; SECRET_LEN],
|
||||||
|
salt: &[u8; SALT_LEN],
|
||||||
|
timestamp: [u8; 8],
|
||||||
|
ip: &[u8],
|
||||||
|
user_agent: &[u8],
|
||||||
|
) -> [u8; MAC_LEN] {
|
||||||
let mut hasher = sha3::Sha3_256::default();
|
let mut hasher = sha3::Sha3_256::default();
|
||||||
hasher.update(secret);
|
hasher.update(secret);
|
||||||
hasher.update(salt);
|
hasher.update(salt);
|
||||||
hasher.update(×tamp);
|
hasher.update(timestamp);
|
||||||
hasher.update(ip);
|
hasher.update(ip);
|
||||||
hasher.update(b"/");
|
hasher.update(b"/");
|
||||||
hasher.update(user_agent);
|
hasher.update(user_agent);
|
||||||
hasher.finalize().into()
|
hasher.finalize().into()
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn format_challenge_cookie(salt: &[u8; SALT_LEN], timestamp: [u8; 8], mac: &[u8; MAC_LEN]) -> String {
|
pub fn format_challenge_cookie(
|
||||||
|
salt: &[u8; SALT_LEN],
|
||||||
|
timestamp: [u8; 8],
|
||||||
|
mac: &[u8; MAC_LEN],
|
||||||
|
) -> String {
|
||||||
let mut buf = Vec::new();
|
let mut buf = Vec::new();
|
||||||
buf.extend_from_slice(salt);
|
buf.extend_from_slice(salt);
|
||||||
buf.extend_from_slice(×tamp);
|
buf.extend_from_slice(×tamp);
|
||||||
|
|
@ -27,7 +42,12 @@ pub fn format_challenge_cookie(salt: &[u8; SALT_LEN], timestamp: [u8; 8], mac: &
|
||||||
base64::engine::general_purpose::URL_SAFE_NO_PAD.encode(buf)
|
base64::engine::general_purpose::URL_SAFE_NO_PAD.encode(buf)
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn verify_challenge_cookie(cookie: &[u8], secret: &[u8; SECRET_LEN], user_agent: &[u8], ip: &[u8]) -> bool {
|
pub fn verify_challenge_cookie(
|
||||||
|
cookie: &[u8],
|
||||||
|
secret: &[u8; SECRET_LEN],
|
||||||
|
user_agent: &[u8],
|
||||||
|
ip: &[u8],
|
||||||
|
) -> bool {
|
||||||
let Ok(cookie_bytes) = base64::engine::general_purpose::URL_SAFE_NO_PAD.decode(cookie) else {
|
let Ok(cookie_bytes) = base64::engine::general_purpose::URL_SAFE_NO_PAD.decode(cookie) else {
|
||||||
dbg!("invalid base64");
|
dbg!("invalid base64");
|
||||||
return false;
|
return false;
|
||||||
|
|
@ -36,14 +56,21 @@ pub fn verify_challenge_cookie(cookie: &[u8], secret: &[u8; SECRET_LEN], user_ag
|
||||||
dbg!("invalid len");
|
dbg!("invalid len");
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
let timestamp: [u8; 8] = cookie_bytes[SALT_LEN..SALT_LEN+8].try_into().unwrap();
|
let timestamp: [u8; 8] = cookie_bytes[SALT_LEN..SALT_LEN + 8].try_into().unwrap();
|
||||||
let timestamp_time = u64::from_be_bytes(timestamp);
|
let timestamp_time = u64::from_be_bytes(timestamp);
|
||||||
if timestamp_time.wrapping_add(CHALLENGE_TIMEOUT) < std::time::SystemTime::UNIX_EPOCH.elapsed().unwrap().as_secs() {
|
if timestamp_time.wrapping_add(CHALLENGE_TIMEOUT)
|
||||||
|
< std::time::SystemTime::UNIX_EPOCH
|
||||||
|
.elapsed()
|
||||||
|
.unwrap()
|
||||||
|
.as_secs()
|
||||||
|
{
|
||||||
dbg!("invalid time");
|
dbg!("invalid time");
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
let salt: [u8; SALT_LEN] = cookie_bytes[0..SALT_LEN].try_into().unwrap();
|
let salt: [u8; SALT_LEN] = cookie_bytes[0..SALT_LEN].try_into().unwrap();
|
||||||
let mac: [u8; MAC_LEN] = cookie_bytes[SALT_LEN + 8..SALT_LEN + 8 + MAC_LEN].try_into().unwrap();
|
let mac: [u8; MAC_LEN] = cookie_bytes[SALT_LEN + 8..SALT_LEN + 8 + MAC_LEN]
|
||||||
|
.try_into()
|
||||||
|
.unwrap();
|
||||||
|
|
||||||
let expected_mac = compute_challenge_mac(secret, &salt, timestamp, ip, user_agent);
|
let expected_mac = compute_challenge_mac(secret, &salt, timestamp, ip, user_agent);
|
||||||
|
|
||||||
|
|
|
||||||
16
src/http.rs
16
src/http.rs
|
|
@ -38,19 +38,3 @@ impl<'a> Iterator for HeaderLineIterator<'a> {
|
||||||
None
|
None
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn parse_cookies<'a>(line: &'a [u8]) -> Option<&'a [u8]> {
|
|
||||||
if line.get(0..7) != Some(b"Cookie:") {
|
|
||||||
return None;
|
|
||||||
}
|
|
||||||
let mut waiting_for_name = true;
|
|
||||||
let mut iter = line.iter().enumerate().skip(7);
|
|
||||||
while let Some((i, c)) = iter.next() {
|
|
||||||
if *c == b' ' {
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
if waiting_for_name {}
|
|
||||||
//iter.advance_by(5);
|
|
||||||
}
|
|
||||||
None
|
|
||||||
}
|
|
||||||
|
|
|
||||||
265
src/main.rs
265
src/main.rs
|
|
@ -6,18 +6,19 @@ use http::HeaderLineIterator;
|
||||||
use policy::{CompiledPolicies, Policy};
|
use policy::{CompiledPolicies, Policy};
|
||||||
|
|
||||||
use rand::Rng;
|
use rand::Rng;
|
||||||
use regex::{bytes::Regex, bytes::RegexSet};
|
use regex::bytes::Regex;
|
||||||
use std::{
|
use std::{io::Write, net::SocketAddr, time::Duration};
|
||||||
io::{BufReader, Write}, net::SocketAddr, sync::atomic::ATOMIC_BOOL_INIT, time::Duration
|
|
||||||
};
|
|
||||||
use tokio::{
|
use tokio::{
|
||||||
io::{AsyncWriteExt, ReadBuf}, net::TcpSocket, time::timeout
|
io::{AsyncWriteExt, ReadBuf},
|
||||||
|
net::{TcpSocket, TcpStream},
|
||||||
|
time::timeout,
|
||||||
};
|
};
|
||||||
|
|
||||||
const SALT_LEN: usize = 16;
|
const SALT_LEN: usize = 16;
|
||||||
const SECRET_LEN: usize = 32;
|
const SECRET_LEN: usize = 32;
|
||||||
const MAC_LEN: usize = 32;
|
const MAC_LEN: usize = 32;
|
||||||
const CHALLENGE_TIMEOUT: u64 = 3600;
|
const CHALLENGE_TIMEOUT: u64 = 3600;
|
||||||
|
const TARGET_ZEROS: u32 = 15;
|
||||||
|
|
||||||
static CHALLENGE_BODY: &str = include_str!("challenge.html");
|
static CHALLENGE_BODY: &str = include_str!("challenge.html");
|
||||||
|
|
||||||
|
|
@ -36,28 +37,34 @@ async fn main() {
|
||||||
|
|
||||||
let listen_addr: SocketAddr = "127.0.0.1:8504".parse().unwrap();
|
let listen_addr: SocketAddr = "127.0.0.1:8504".parse().unwrap();
|
||||||
let pass_addr: SocketAddr = "127.0.0.1:80".parse().unwrap();
|
let pass_addr: SocketAddr = "127.0.0.1:80".parse().unwrap();
|
||||||
let policy_groups = &[&[Policy {
|
let policy_groups = vec![vec![
|
||||||
name: String::from("Block"),
|
Policy {
|
||||||
filter: policy::Filter::FirstLineMatch(String::from("GET /block")),
|
name: String::from("Favicon"),
|
||||||
action: policy::Action::Drop,
|
first_line_regex: String::from(r"^GET /favicon.ico"),
|
||||||
priority: 0,
|
action: policy::Action::Allow,
|
||||||
}]];
|
},
|
||||||
|
Policy {
|
||||||
|
name: String::from("robots.txt"),
|
||||||
|
first_line_regex: String::from(r"^GET /robots.txt"),
|
||||||
|
action: policy::Action::Allow,
|
||||||
|
},
|
||||||
|
Policy {
|
||||||
|
name: String::from("Block"),
|
||||||
|
first_line_regex: String::from(r"^GET /block"),
|
||||||
|
action: policy::Action::Drop,
|
||||||
|
},
|
||||||
|
]];
|
||||||
|
let default_action = policy::Action::Challenge;
|
||||||
let secret: [u8; SECRET_LEN] = rng.r#gen();
|
let secret: [u8; SECRET_LEN] = rng.r#gen();
|
||||||
|
|
||||||
let challenge_response = &*mk_static!(
|
let policy_groups = &*mk_static!(
|
||||||
String,
|
Vec<CompiledPolicies>,
|
||||||
format!(
|
policy_groups
|
||||||
"HTTP/1.1 200\r\ncontent-type: text/html\r\ncontent-length: {}\r\n\r\n{}",
|
.into_iter()
|
||||||
CHALLENGE_BODY.len(),
|
.map(CompiledPolicies::new)
|
||||||
CHALLENGE_BODY
|
.collect()
|
||||||
)
|
|
||||||
);
|
);
|
||||||
|
|
||||||
let policy_groups: Vec<CompiledPolicies> = policy_groups
|
|
||||||
.into_iter()
|
|
||||||
.map(|policies| CompiledPolicies::new(*policies))
|
|
||||||
.collect();
|
|
||||||
|
|
||||||
let socket = realm_syscall::new_tcp_socket(&listen_addr).unwrap();
|
let socket = realm_syscall::new_tcp_socket(&listen_addr).unwrap();
|
||||||
|
|
||||||
socket.set_reuse_address(true).ok();
|
socket.set_reuse_address(true).ok();
|
||||||
|
|
@ -68,16 +75,26 @@ async fn main() {
|
||||||
let listener = tokio::net::TcpListener::from_std(socket.into()).unwrap();
|
let listener = tokio::net::TcpListener::from_std(socket.into()).unwrap();
|
||||||
|
|
||||||
let proof_regex =
|
let proof_regex =
|
||||||
Regex::new(r"^Cookie: *(?:[^;=]+=[^;=]* *; *)*mesozoa-proof *= *([0-9a-zA-Z_-]{4})").unwrap();
|
Regex::new(r"^Cookie: *(?:[^;=]+=[^;=]* *; *)*mesozoa-proof *= *([0-9a-zA-Z_-]{8})")
|
||||||
|
.unwrap();
|
||||||
let challenge_regex =
|
let challenge_regex =
|
||||||
Regex::new(r"^Cookie: *(?:[^;=]+=[^;=]* *; *)*mesozoa-challenge *= *([0-9a-zA-Z_-]{75})").unwrap();
|
Regex::new(r"^Cookie: *(?:[^;=]+=[^;=]* *; *)*mesozoa-challenge *= *([0-9a-zA-Z_-]{75})")
|
||||||
let ip_regex =
|
.unwrap();
|
||||||
Regex::new(r"^X-Forwarded-For: *([a-fA-F0-9.:]+)$").unwrap();
|
let ip_regex = Regex::new(r"^X-Forwarded-For: *([a-fA-F0-9.:]+)$").unwrap();
|
||||||
let user_agent_regex =
|
let user_agent_regex = Regex::new(r"^User-Agent: *([a-zA-Z0-9.,:;/ _()-]+)$").unwrap();
|
||||||
Regex::new(r"^User-Agent: *([a-zA-Z0-9.,:;/ _()-]+)$").unwrap();
|
|
||||||
|
let response_begin = &*mk_static!(
|
||||||
|
String,
|
||||||
|
format!(
|
||||||
|
"HTTP/1.1 200\r\n\
|
||||||
|
content-type: text/html\r\n\
|
||||||
|
content-length: {}\r\n",
|
||||||
|
CHALLENGE_BODY.len(),
|
||||||
|
)
|
||||||
|
);
|
||||||
|
|
||||||
loop {
|
loop {
|
||||||
let Ok((mut client_stream, client_addr)) = listener.accept().await else {
|
let Ok((mut client_stream, _client_addr)) = listener.accept().await else {
|
||||||
continue;
|
continue;
|
||||||
};
|
};
|
||||||
//client_stream.set_nodelay(true).ok();
|
//client_stream.set_nodelay(true).ok();
|
||||||
|
|
@ -89,11 +106,12 @@ async fn main() {
|
||||||
tokio::spawn(async move {
|
tokio::spawn(async move {
|
||||||
let mut buf = [0u8; 1024];
|
let mut buf = [0u8; 1024];
|
||||||
let mut buf_reader = ReadBuf::new(&mut buf);
|
let mut buf_reader = ReadBuf::new(&mut buf);
|
||||||
if let Err(_) = timeout(
|
if timeout(
|
||||||
Duration::from_millis(100),
|
Duration::from_millis(100),
|
||||||
std::future::poll_fn(|cx| client_stream.poll_peek(cx, &mut buf_reader)),
|
std::future::poll_fn(|cx| client_stream.poll_peek(cx, &mut buf_reader)),
|
||||||
)
|
)
|
||||||
.await
|
.await
|
||||||
|
.is_err()
|
||||||
{
|
{
|
||||||
println!("peek timeout");
|
println!("peek timeout");
|
||||||
return;
|
return;
|
||||||
|
|
@ -102,85 +120,136 @@ async fn main() {
|
||||||
let mut stdout = std::io::stdout();
|
let mut stdout = std::io::stdout();
|
||||||
stdout.write_all(&buf).unwrap();
|
stdout.write_all(&buf).unwrap();
|
||||||
stdout.flush().unwrap();
|
stdout.flush().unwrap();
|
||||||
println!("");
|
println!();
|
||||||
|
|
||||||
let mut header_line_iter = HeaderLineIterator::new(&buf);
|
let mut header_line_iter = HeaderLineIterator::new(&buf);
|
||||||
let Some(first_line) = header_line_iter.next() else {
|
let Some(first_line) = header_line_iter.next() else {
|
||||||
println!("Not HTTP, or too long line");
|
println!("Not HTTP, or too long line");
|
||||||
return;
|
return;
|
||||||
};
|
};
|
||||||
// TODO matching
|
|
||||||
// for test we will challenge everything!
|
let mut action = default_action;
|
||||||
let mut req_challenge = None;
|
for policy_group in policy_groups.iter() {
|
||||||
let mut req_proof = None;
|
if let Some(policy) = policy_group.evaluate(first_line) {
|
||||||
let mut req_user_agent: &[u8] = &[];
|
println!("Applying policy {}", policy.name);
|
||||||
let mut req_ip: &[u8] = &[];
|
action = policy.action;
|
||||||
for line in header_line_iter {
|
break;
|
||||||
if let Some(Some(m)) = challenge_regex.captures(line).map(|c| c.get(1)) {
|
|
||||||
req_challenge = Some(m.as_bytes());
|
|
||||||
}
|
|
||||||
if let Some(Some(m)) = proof_regex.captures(line).map(|c| c.get(1)) {
|
|
||||||
req_proof = Some(m.as_bytes());
|
|
||||||
}
|
|
||||||
if let Some(Some(m)) = user_agent_regex.captures(line).map(|c| c.get(1)) {
|
|
||||||
req_user_agent = m.as_bytes();
|
|
||||||
}
|
|
||||||
if let Some(Some(m)) = ip_regex.captures(line).map(|c| c.get(1)) {
|
|
||||||
req_ip = m.as_bytes();
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
let mut allow = false;
|
match action {
|
||||||
|
policy::Action::Drop => {}
|
||||||
if let Some(req_challenge) = req_challenge {
|
policy::Action::Allow => {
|
||||||
allow = challenge::verify_challenge_cookie(req_challenge, &secret, req_user_agent, req_ip);
|
do_proxy(pass_addr, client_stream).await;
|
||||||
}
|
}
|
||||||
|
policy::Action::Challenge => {
|
||||||
if allow {
|
let mut req_challenge = None;
|
||||||
// TODO reuse connections
|
let mut req_proof = None;
|
||||||
let pass_socket = realm_syscall::new_tcp_socket(&pass_addr).unwrap();
|
let mut req_user_agent: &[u8] = &[];
|
||||||
|
let mut req_ip: &[u8] = &[];
|
||||||
pass_socket.set_reuse_address(true).ok();
|
for line in header_line_iter {
|
||||||
|
if let Some(Some(m)) = challenge_regex.captures(line).map(|c| c.get(1)) {
|
||||||
let pass_socket = TcpSocket::from_std_stream(pass_socket.into());
|
req_challenge = Some(m.as_bytes());
|
||||||
|
}
|
||||||
let mut pass_stream = pass_socket.connect(pass_addr).await.unwrap();
|
if let Some(Some(m)) = proof_regex.captures(line).map(|c| c.get(1)) {
|
||||||
|
req_proof = Some(m.as_bytes());
|
||||||
match realm_io::bidi_zero_copy(&mut client_stream, &mut pass_stream).await {
|
}
|
||||||
Ok(_) => {},
|
if let Some(Some(m)) = user_agent_regex.captures(line).map(|c| c.get(1)) {
|
||||||
Err(ref e) if e.kind() == tokio::io::ErrorKind::InvalidInput => {
|
req_user_agent = m.as_bytes();
|
||||||
realm_io::bidi_copy(&mut client_stream, &mut pass_stream).await.unwrap();
|
}
|
||||||
|
if let Some(Some(m)) = ip_regex.captures(line).map(|c| c.get(1)) {
|
||||||
|
req_ip = m.as_bytes();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
let mut allow = false;
|
||||||
|
let mut valid_challenge = false;
|
||||||
|
|
||||||
|
if let (Some(req_challenge), Some(req_proof)) = (req_challenge, req_proof) {
|
||||||
|
valid_challenge = challenge::verify_challenge_cookie(
|
||||||
|
req_challenge,
|
||||||
|
&secret,
|
||||||
|
req_user_agent,
|
||||||
|
req_ip,
|
||||||
|
);
|
||||||
|
allow = dbg!(valid_challenge)
|
||||||
|
&& dbg!(challenge::check_challenge(
|
||||||
|
req_challenge,
|
||||||
|
req_proof,
|
||||||
|
TARGET_ZEROS
|
||||||
|
));
|
||||||
|
}
|
||||||
|
|
||||||
|
if allow {
|
||||||
|
do_proxy(pass_addr, client_stream).await;
|
||||||
|
} else {
|
||||||
|
let salt: [u8; SALT_LEN] = rand::thread_rng().r#gen();
|
||||||
|
|
||||||
|
let timestamp = std::time::SystemTime::now()
|
||||||
|
.duration_since(std::time::UNIX_EPOCH)
|
||||||
|
.unwrap()
|
||||||
|
.as_secs();
|
||||||
|
let timestamp_bytes = timestamp.to_be_bytes();
|
||||||
|
|
||||||
|
let challenge_mac = challenge::compute_challenge_mac(
|
||||||
|
&secret,
|
||||||
|
&salt,
|
||||||
|
timestamp_bytes,
|
||||||
|
req_ip,
|
||||||
|
req_user_agent,
|
||||||
|
);
|
||||||
|
|
||||||
|
let challenge_cookie = challenge::format_challenge_cookie(
|
||||||
|
&salt,
|
||||||
|
timestamp_bytes,
|
||||||
|
&challenge_mac,
|
||||||
|
);
|
||||||
|
|
||||||
|
client_stream.writable().await.unwrap();
|
||||||
|
client_stream
|
||||||
|
.write_all(response_begin.as_bytes())
|
||||||
|
.await
|
||||||
|
.unwrap();
|
||||||
|
if !valid_challenge {
|
||||||
|
client_stream
|
||||||
|
.write_all(b"set-cookie: mesozoa-challenge=")
|
||||||
|
.await
|
||||||
|
.unwrap();
|
||||||
|
client_stream
|
||||||
|
.write_all(challenge_cookie.as_bytes())
|
||||||
|
.await
|
||||||
|
.unwrap();
|
||||||
|
client_stream.write_all(b"; domain=127.0.0.1; path=/; max-age=3600; samesite=strict\r\n").await.unwrap();
|
||||||
|
}
|
||||||
|
client_stream.write_all(b"\r\n").await.unwrap();
|
||||||
|
client_stream
|
||||||
|
.write_all(CHALLENGE_BODY.as_bytes())
|
||||||
|
.await
|
||||||
|
.unwrap();
|
||||||
}
|
}
|
||||||
Err(e) => panic!("err {}", e),
|
|
||||||
}
|
}
|
||||||
} else {
|
|
||||||
let salt: [u8; SALT_LEN] = rand::thread_rng().r#gen();
|
|
||||||
|
|
||||||
let timestamp = std::time::SystemTime::now().duration_since(std::time::UNIX_EPOCH).unwrap().as_secs();
|
|
||||||
let timestamp_bytes = timestamp.to_be_bytes();
|
|
||||||
|
|
||||||
let challenge_mac = challenge::compute_challenge_mac(&secret, &salt, timestamp_bytes, req_ip, req_user_agent);
|
|
||||||
|
|
||||||
let challenge_cookie = challenge::format_challenge_cookie(&salt, timestamp_bytes, &challenge_mac);
|
|
||||||
|
|
||||||
let response = format!(
|
|
||||||
"HTTP/1.1 200\r\n\
|
|
||||||
content-type: text/html\r\n\
|
|
||||||
content-length: {}\r\n\
|
|
||||||
set-cookie: mesozoa-challenge={}; max-age=3600; samesite=strict\r\n\
|
|
||||||
\r\n\
|
|
||||||
{}",
|
|
||||||
CHALLENGE_BODY.len(),
|
|
||||||
challenge_cookie,
|
|
||||||
CHALLENGE_BODY,
|
|
||||||
);
|
|
||||||
|
|
||||||
client_stream.writable().await.unwrap();
|
|
||||||
client_stream
|
|
||||||
.write_all(response.as_bytes())
|
|
||||||
.await
|
|
||||||
.unwrap();
|
|
||||||
}
|
}
|
||||||
});
|
});
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
async fn do_proxy(pass_addr: SocketAddr, mut client_stream: TcpStream) {
|
||||||
|
// TODO reuse connections
|
||||||
|
let pass_socket = realm_syscall::new_tcp_socket(&pass_addr).unwrap();
|
||||||
|
|
||||||
|
pass_socket.set_reuse_address(true).ok();
|
||||||
|
|
||||||
|
let pass_socket = TcpSocket::from_std_stream(pass_socket.into());
|
||||||
|
|
||||||
|
let mut pass_stream = pass_socket.connect(pass_addr).await.unwrap();
|
||||||
|
|
||||||
|
match realm_io::bidi_zero_copy(&mut client_stream, &mut pass_stream).await {
|
||||||
|
Ok(_) => {}
|
||||||
|
Err(ref e) if e.kind() == tokio::io::ErrorKind::InvalidInput => {
|
||||||
|
realm_io::bidi_copy(&mut client_stream, &mut pass_stream)
|
||||||
|
.await
|
||||||
|
.unwrap();
|
||||||
|
}
|
||||||
|
Err(e) => panic!("err {}", e),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
|
||||||
198
src/policy.bak.rs
Normal file
198
src/policy.bak.rs
Normal file
|
|
@ -0,0 +1,198 @@
|
||||||
|
use regex::bytes::{Regex, RegexSet, SetMatches};
|
||||||
|
|
||||||
|
#[derive(Clone, Debug)]
|
||||||
|
pub enum Action {
|
||||||
|
Allow,
|
||||||
|
Challenge,
|
||||||
|
Drop,
|
||||||
|
}
|
||||||
|
|
||||||
|
#[derive(Clone, Debug)]
|
||||||
|
pub enum Filter {
|
||||||
|
Bool(bool),
|
||||||
|
FirstLineMatch(String),
|
||||||
|
HeaderLineMatch(String),
|
||||||
|
And(Vec<Filter>),
|
||||||
|
Or(Vec<Filter>),
|
||||||
|
Not(Box<Filter>),
|
||||||
|
}
|
||||||
|
|
||||||
|
impl Filter {
|
||||||
|
fn compile<'a>(
|
||||||
|
&'a self,
|
||||||
|
first_line_regexes: &mut Vec<&'a str>,
|
||||||
|
header_line_regexes: &mut Vec<&'a str>,
|
||||||
|
) -> CompiledFilter {
|
||||||
|
match self {
|
||||||
|
Filter::Bool(v) => CompiledFilter::Bool(*v),
|
||||||
|
Filter::And(filters) => CompiledFilter::And(
|
||||||
|
filters
|
||||||
|
.iter()
|
||||||
|
.map(|filter| filter.compile(first_line_regexes, header_line_regexes))
|
||||||
|
.collect(),
|
||||||
|
),
|
||||||
|
Filter::Or(filters) => CompiledFilter::Or(
|
||||||
|
filters
|
||||||
|
.iter()
|
||||||
|
.map(|filter| filter.compile(first_line_regexes, header_line_regexes))
|
||||||
|
.collect(),
|
||||||
|
),
|
||||||
|
Filter::Not(filter) => CompiledFilter::Not(Box::new(
|
||||||
|
filter.compile(first_line_regexes, header_line_regexes),
|
||||||
|
)),
|
||||||
|
Filter::FirstLineMatch(regex) => {
|
||||||
|
let filter = CompiledFilter::FirstLineMatch(first_line_regexes.len());
|
||||||
|
first_line_regexes.push(regex);
|
||||||
|
filter
|
||||||
|
}
|
||||||
|
Filter::HeaderLineMatch(regex) => {
|
||||||
|
let filter = CompiledFilter::HeaderLineMatch(header_line_regexes.len());
|
||||||
|
header_line_regexes.push(regex);
|
||||||
|
filter
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
#[derive(Clone, Debug)]
|
||||||
|
pub struct Policy {
|
||||||
|
pub name: String,
|
||||||
|
pub filter: Filter,
|
||||||
|
pub action: Action,
|
||||||
|
pub priority: i32,
|
||||||
|
}
|
||||||
|
|
||||||
|
pub enum CompiledFilter {
|
||||||
|
Bool(bool),
|
||||||
|
FirstLineMatch(usize),
|
||||||
|
HeaderLineMatch(usize),
|
||||||
|
And(Vec<CompiledFilter>),
|
||||||
|
Or(Vec<CompiledFilter>),
|
||||||
|
Not(Box<CompiledFilter>),
|
||||||
|
}
|
||||||
|
|
||||||
|
/*impl CompiledFilter {
|
||||||
|
fn evaluate(&self, matches: &SetMatches) -> bool {
|
||||||
|
match self {
|
||||||
|
Self::And(filters) => filters.iter().all(Self::evaluate),
|
||||||
|
Self::Or(filters) => filters.iter().any(Self::evaluate),
|
||||||
|
Self::Bool(b) => *b,
|
||||||
|
Self::Not(filter) => !filter.evaluate(matches),
|
||||||
|
Self::FirstLineMatch(regex_id) => matches.matched(regex_id),
|
||||||
|
Self::HeaderLineMatch(regex_id) => matches.matched(regex_id),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}*/
|
||||||
|
|
||||||
|
pub struct CompiledPolicy {
|
||||||
|
pub name: String,
|
||||||
|
pub filter: CompiledFilter,
|
||||||
|
pub priority: i32,
|
||||||
|
pub action: Action,
|
||||||
|
}
|
||||||
|
|
||||||
|
pub struct CompiledPolicies {
|
||||||
|
pub first_line_regex_set: Option<RegexSet>,
|
||||||
|
pub header_line_regex_set: Option<RegexSet>,
|
||||||
|
pub policies: Vec<CompiledPolicy>,
|
||||||
|
}
|
||||||
|
|
||||||
|
pub enum RegexOrRegexSet {
|
||||||
|
Many(RegexSet),
|
||||||
|
One(Regex),
|
||||||
|
None,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl TryInto<RegexOrRegexSet> for Vec<&str> {
|
||||||
|
type Error = regex::Error;
|
||||||
|
fn try_into(self) -> Result<RegexOrRegexSet, regex::Error> {
|
||||||
|
Ok(match self.len() {
|
||||||
|
0 => RegexOrRegexSet::None,
|
||||||
|
1 => RegexOrRegexSet::One(Regex::new(self[0])?),
|
||||||
|
_ => RegexOrRegexSet::Many(RegexSet::new(self)?)
|
||||||
|
})
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
impl CompiledPolicies {
|
||||||
|
pub fn new<'a>(policies: impl IntoIterator<Item = &'a Policy>) -> Self {
|
||||||
|
let mut first_line_regexes = Vec::new();
|
||||||
|
let mut header_line_regexes = Vec::new();
|
||||||
|
let mut compiled_policies = Vec::new();
|
||||||
|
|
||||||
|
for policy in policies {
|
||||||
|
let compiled_policy = CompiledPolicy {
|
||||||
|
name: policy.name.clone(),
|
||||||
|
filter: policy
|
||||||
|
.filter
|
||||||
|
.compile(&mut first_line_regexes, &mut header_line_regexes),
|
||||||
|
priority: policy.priority,
|
||||||
|
action: policy.action.clone(),
|
||||||
|
};
|
||||||
|
compiled_policies.push(compiled_policy);
|
||||||
|
}
|
||||||
|
|
||||||
|
CompiledPolicies {
|
||||||
|
first_line_regex_set: if first_line_regexes.is_empty() {
|
||||||
|
None
|
||||||
|
} else {
|
||||||
|
Some(RegexSet::new(&first_line_regexes).unwrap())
|
||||||
|
},
|
||||||
|
header_line_regex_set: if header_line_regexes.is_empty() {
|
||||||
|
None
|
||||||
|
} else {
|
||||||
|
Some(RegexSet::new(&header_line_regexes).unwrap())
|
||||||
|
},
|
||||||
|
policies: compiled_policies,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/*pub fn evaluate<'a>(
|
||||||
|
&self,
|
||||||
|
mut header_lines: impl Iterator<Item = &'a [u8]>,
|
||||||
|
) -> Result<Option<&CompiledPolicy>, PolicyEvaluationError> {
|
||||||
|
let mut best_policy: Option<&CompiledPolicy> = None;
|
||||||
|
|
||||||
|
let first_line = header_lines
|
||||||
|
.next()
|
||||||
|
.ok_or(PolicyEvaluationError::NoFirstLine)?;
|
||||||
|
|
||||||
|
if let Some(first_line_regex_set) = &self.first_line_regex_set {
|
||||||
|
let matches = first_line_regex_set.matches(first_line);
|
||||||
|
for policy in self.policies.iter() {
|
||||||
|
|
||||||
|
}
|
||||||
|
let policy = &self.policies[matched];
|
||||||
|
if let Some(best_policy) = &mut best_policy {
|
||||||
|
if policy.priority < best_policy.priority {
|
||||||
|
*best_policy = policy;
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
best_policy = Some(policy);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if let Some(header_line_regex_set) = &self.header_line_regex_set {
|
||||||
|
for header_line in header_lines {
|
||||||
|
for matched in header_line_regex_set.matches(header_line) {
|
||||||
|
let policy = &self.policies[matched];
|
||||||
|
if let Some(best_policy) = &mut best_policy {
|
||||||
|
if policy.priority < best_policy.priority {
|
||||||
|
*best_policy = policy;
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
best_policy = Some(policy);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
Ok(best_policy)
|
||||||
|
}*/
|
||||||
|
}
|
||||||
|
|
||||||
|
#[derive(Debug)]
|
||||||
|
pub enum PolicyEvaluationError {
|
||||||
|
/// First HTTP line is too long or absent
|
||||||
|
NoFirstLine,
|
||||||
|
}
|
||||||
128
src/policy.rs
128
src/policy.rs
|
|
@ -1,143 +1,41 @@
|
||||||
use regex::{Regex, RegexSet};
|
use regex::bytes::RegexSet;
|
||||||
|
|
||||||
#[derive(Clone, Debug)]
|
#[derive(Clone, Copy, Debug)]
|
||||||
pub enum Action {
|
pub enum Action {
|
||||||
Allow,
|
Allow,
|
||||||
Challenge,
|
Challenge,
|
||||||
Drop,
|
Drop,
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Clone, Debug)]
|
|
||||||
pub enum Filter {
|
|
||||||
Bool(bool),
|
|
||||||
FirstLineMatch(String),
|
|
||||||
HeaderLineMatch(String),
|
|
||||||
And(Vec<Filter>),
|
|
||||||
Or(Vec<Filter>),
|
|
||||||
Not(Box<Filter>),
|
|
||||||
}
|
|
||||||
|
|
||||||
impl Filter {
|
|
||||||
fn compile<'a>(
|
|
||||||
&'a self,
|
|
||||||
first_line_regexes: &mut Vec<&'a str>,
|
|
||||||
header_line_regexes: &mut Vec<&'a str>,
|
|
||||||
) -> CompiledFilter {
|
|
||||||
match self {
|
|
||||||
Filter::Bool(v) => CompiledFilter::Bool(*v),
|
|
||||||
Filter::And(filters) => CompiledFilter::And(
|
|
||||||
filters
|
|
||||||
.iter()
|
|
||||||
.map(|filter| filter.compile(first_line_regexes, header_line_regexes))
|
|
||||||
.collect(),
|
|
||||||
),
|
|
||||||
Filter::Or(filters) => CompiledFilter::Or(
|
|
||||||
filters
|
|
||||||
.iter()
|
|
||||||
.map(|filter| filter.compile(first_line_regexes, header_line_regexes))
|
|
||||||
.collect(),
|
|
||||||
),
|
|
||||||
Filter::Not(filter) => CompiledFilter::Not(Box::new(
|
|
||||||
filter.compile(first_line_regexes, header_line_regexes),
|
|
||||||
)),
|
|
||||||
Filter::FirstLineMatch(regex) => {
|
|
||||||
let filter = CompiledFilter::FirstLineMatch(first_line_regexes.len());
|
|
||||||
first_line_regexes.push(regex);
|
|
||||||
filter
|
|
||||||
}
|
|
||||||
Filter::HeaderLineMatch(regex) => {
|
|
||||||
let filter = CompiledFilter::HeaderLineMatch(header_line_regexes.len());
|
|
||||||
header_line_regexes.push(regex);
|
|
||||||
filter
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Clone, Debug)]
|
#[derive(Clone, Debug)]
|
||||||
pub struct Policy {
|
pub struct Policy {
|
||||||
pub name: String,
|
pub name: String,
|
||||||
pub filter: Filter,
|
pub first_line_regex: String,
|
||||||
pub action: Action,
|
|
||||||
pub priority: i32,
|
|
||||||
}
|
|
||||||
|
|
||||||
pub enum CompiledFilter {
|
|
||||||
Bool(bool),
|
|
||||||
FirstLineMatch(usize),
|
|
||||||
HeaderLineMatch(usize),
|
|
||||||
And(Vec<CompiledFilter>),
|
|
||||||
Or(Vec<CompiledFilter>),
|
|
||||||
Not(Box<CompiledFilter>),
|
|
||||||
}
|
|
||||||
|
|
||||||
pub struct CompiledPolicy {
|
|
||||||
pub name: String,
|
|
||||||
pub filter: CompiledFilter,
|
|
||||||
pub priority: i32,
|
|
||||||
pub action: Action,
|
pub action: Action,
|
||||||
}
|
}
|
||||||
|
|
||||||
pub struct CompiledPolicies {
|
pub struct CompiledPolicies {
|
||||||
pub first_line_regex_set: Option<RegexSet>,
|
pub first_line_regex_set: RegexSet,
|
||||||
pub header_line_regex_set: Option<RegexSet>,
|
pub policies: Vec<Policy>,
|
||||||
pub policies: Vec<CompiledPolicy>,
|
|
||||||
}
|
}
|
||||||
|
|
||||||
impl CompiledPolicies {
|
impl CompiledPolicies {
|
||||||
pub fn new<'a>(policies: impl IntoIterator<Item = &'a Policy>) -> Self {
|
pub fn new(policies: Vec<Policy>) -> Self {
|
||||||
let mut first_line_regexes = Vec::new();
|
let mut first_line_regexes = Vec::new();
|
||||||
let mut header_line_regexes = Vec::new();
|
|
||||||
let mut compiled_policies = Vec::new();
|
|
||||||
|
|
||||||
for policy in policies {
|
for policy in policies.iter() {
|
||||||
let compiled_policy = CompiledPolicy {
|
first_line_regexes.push(&policy.first_line_regex);
|
||||||
name: policy.name.clone(),
|
|
||||||
filter: policy
|
|
||||||
.filter
|
|
||||||
.compile(&mut first_line_regexes, &mut header_line_regexes),
|
|
||||||
priority: policy.priority,
|
|
||||||
action: policy.action.clone(),
|
|
||||||
};
|
|
||||||
compiled_policies.push(compiled_policy);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
CompiledPolicies {
|
CompiledPolicies {
|
||||||
first_line_regex_set: if first_line_regexes.is_empty() {
|
first_line_regex_set: RegexSet::new(&first_line_regexes).unwrap(),
|
||||||
None
|
policies,
|
||||||
} else {
|
|
||||||
Some(RegexSet::new(&first_line_regexes).unwrap())
|
|
||||||
},
|
|
||||||
header_line_regex_set: if header_line_regexes.is_empty() {
|
|
||||||
None
|
|
||||||
} else {
|
|
||||||
Some(RegexSet::new(&header_line_regexes).unwrap())
|
|
||||||
},
|
|
||||||
policies: compiled_policies,
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn evaluate<'a>(
|
pub fn evaluate(&self, first_line: &[u8]) -> Option<&Policy> {
|
||||||
&self,
|
let matches = self.first_line_regex_set.matches(first_line);
|
||||||
mut header_lines: impl Iterator<Item = &'a [u8]>,
|
|
||||||
) -> Result<Option<&CompiledPolicy>, PolicyEvaluationError> {
|
|
||||||
let mut best_policy = None;
|
|
||||||
let mut best_priority = i32::MAX;
|
|
||||||
|
|
||||||
let first_line = header_lines
|
matches.into_iter().next().map(|i| &self.policies[i])
|
||||||
.next()
|
|
||||||
.ok_or(PolicyEvaluationError::NoFirstLine)?;
|
|
||||||
|
|
||||||
if let Some(first_line_regex_set) = &self.first_line_regex_set {
|
|
||||||
//let matches = first_line_regex_set.matches(first_line);
|
|
||||||
}
|
|
||||||
|
|
||||||
Ok(best_policy)
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Debug)]
|
|
||||||
pub enum PolicyEvaluationError {
|
|
||||||
/// First HTTP line is too long or absent
|
|
||||||
NoFirstLine,
|
|
||||||
}
|
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue