Compare commits
5 Commits
main
...
7d6163b3dd
Author | SHA1 | Date | |
---|---|---|---|
7d6163b3dd | |||
336b8311cd | |||
b07711341f | |||
063a4f3cf9 | |||
9f5abcafa1 |
@@ -9,13 +9,9 @@ set(CMAKE_CXX_FLAGS "-Wall -g -fsanitize=address")
|
|||||||
|
|
||||||
add_executable(
|
add_executable(
|
||||||
Webserver
|
Webserver
|
||||||
"src/Base/Entry.cpp"
|
"src/Entry.cpp" "src/Webserver.cpp" "src/HTTP.cpp"
|
||||||
"src/Base/Webserver.cpp"
|
"libs/QuickDigest5/quickdigest5.cpp" "src/Helpers.cpp"
|
||||||
"src/HTTP/HTTP.cpp"
|
"src/HTTPRequestProcess.cpp")
|
||||||
"src/Helpers/Helpers.cpp"
|
|
||||||
"src/HTTP/HTTPRequestProcess.cpp"
|
|
||||||
"src/HTTPMethods.cpp"
|
|
||||||
"src/Helpers/HelpersFormProcess.cpp")
|
|
||||||
|
|
||||||
add_custom_command(
|
add_custom_command(
|
||||||
TARGET Webserver
|
TARGET Webserver
|
||||||
|
14
README.md
14
README.md
@@ -1,6 +1,6 @@
|
|||||||
# Web Base for C++
|
# TNC File Hoster
|
||||||
|
|
||||||
A good starting point for web development on C++. Do implement security stuff.
|
The Night Club's very own basic image hosting web frontend.
|
||||||
|
|
||||||
# Building
|
# Building
|
||||||
|
|
||||||
@@ -13,3 +13,13 @@ A good starting point for web development on C++. Do implement security stuff.
|
|||||||
4. lastly run ``$ make``
|
4. lastly run ``$ make``
|
||||||
|
|
||||||
You can run ``./Webserver`` to run the server fully.
|
You can run ``./Webserver`` to run the server fully.
|
||||||
|
|
||||||
|
|
||||||
|
# Coing Guidelines
|
||||||
|
|
||||||
|
- In most of my projects I have less header(h/hpp) files than implementation files(c/cpp). This is very much intentional. I implement parts of a header file for ease of reading. You are expected to NOT make 1 header per 1 implementation file!!!
|
||||||
|
|
||||||
|
- When doing ``#include`` if the same include is used more than once in different implementation files that share a header file. Move the ``#include`` to the header file instead of having two of the same includes.
|
||||||
|
|
||||||
|
- Codebase must adhere to DRY and KISS (DRY KISS) principles!
|
||||||
|
|
||||||
|
674
libs/QuickDigest5/LICENSE
Normal file
674
libs/QuickDigest5/LICENSE
Normal file
@@ -0,0 +1,674 @@
|
|||||||
|
GNU GENERAL PUBLIC LICENSE
|
||||||
|
Version 3, 29 June 2007
|
||||||
|
|
||||||
|
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||||
|
Everyone is permitted to copy and distribute verbatim copies
|
||||||
|
of this license document, but changing it is not allowed.
|
||||||
|
|
||||||
|
Preamble
|
||||||
|
|
||||||
|
The GNU General Public License is a free, copyleft license for
|
||||||
|
software and other kinds of works.
|
||||||
|
|
||||||
|
The licenses for most software and other practical works are designed
|
||||||
|
to take away your freedom to share and change the works. By contrast,
|
||||||
|
the GNU General Public License is intended to guarantee your freedom to
|
||||||
|
share and change all versions of a program--to make sure it remains free
|
||||||
|
software for all its users. We, the Free Software Foundation, use the
|
||||||
|
GNU General Public License for most of our software; it applies also to
|
||||||
|
any other work released this way by its authors. You can apply it to
|
||||||
|
your programs, too.
|
||||||
|
|
||||||
|
When we speak of free software, we are referring to freedom, not
|
||||||
|
price. Our General Public Licenses are designed to make sure that you
|
||||||
|
have the freedom to distribute copies of free software (and charge for
|
||||||
|
them if you wish), that you receive source code or can get it if you
|
||||||
|
want it, that you can change the software or use pieces of it in new
|
||||||
|
free programs, and that you know you can do these things.
|
||||||
|
|
||||||
|
To protect your rights, we need to prevent others from denying you
|
||||||
|
these rights or asking you to surrender the rights. Therefore, you have
|
||||||
|
certain responsibilities if you distribute copies of the software, or if
|
||||||
|
you modify it: responsibilities to respect the freedom of others.
|
||||||
|
|
||||||
|
For example, if you distribute copies of such a program, whether
|
||||||
|
gratis or for a fee, you must pass on to the recipients the same
|
||||||
|
freedoms that you received. You must make sure that they, too, receive
|
||||||
|
or can get the source code. And you must show them these terms so they
|
||||||
|
know their rights.
|
||||||
|
|
||||||
|
Developers that use the GNU GPL protect your rights with two steps:
|
||||||
|
(1) assert copyright on the software, and (2) offer you this License
|
||||||
|
giving you legal permission to copy, distribute and/or modify it.
|
||||||
|
|
||||||
|
For the developers' and authors' protection, the GPL clearly explains
|
||||||
|
that there is no warranty for this free software. For both users' and
|
||||||
|
authors' sake, the GPL requires that modified versions be marked as
|
||||||
|
changed, so that their problems will not be attributed erroneously to
|
||||||
|
authors of previous versions.
|
||||||
|
|
||||||
|
Some devices are designed to deny users access to install or run
|
||||||
|
modified versions of the software inside them, although the manufacturer
|
||||||
|
can do so. This is fundamentally incompatible with the aim of
|
||||||
|
protecting users' freedom to change the software. The systematic
|
||||||
|
pattern of such abuse occurs in the area of products for individuals to
|
||||||
|
use, which is precisely where it is most unacceptable. Therefore, we
|
||||||
|
have designed this version of the GPL to prohibit the practice for those
|
||||||
|
products. If such problems arise substantially in other domains, we
|
||||||
|
stand ready to extend this provision to those domains in future versions
|
||||||
|
of the GPL, as needed to protect the freedom of users.
|
||||||
|
|
||||||
|
Finally, every program is threatened constantly by software patents.
|
||||||
|
States should not allow patents to restrict development and use of
|
||||||
|
software on general-purpose computers, but in those that do, we wish to
|
||||||
|
avoid the special danger that patents applied to a free program could
|
||||||
|
make it effectively proprietary. To prevent this, the GPL assures that
|
||||||
|
patents cannot be used to render the program non-free.
|
||||||
|
|
||||||
|
The precise terms and conditions for copying, distribution and
|
||||||
|
modification follow.
|
||||||
|
|
||||||
|
TERMS AND CONDITIONS
|
||||||
|
|
||||||
|
0. Definitions.
|
||||||
|
|
||||||
|
"This License" refers to version 3 of the GNU General Public License.
|
||||||
|
|
||||||
|
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||||
|
works, such as semiconductor masks.
|
||||||
|
|
||||||
|
"The Program" refers to any copyrightable work licensed under this
|
||||||
|
License. Each licensee is addressed as "you". "Licensees" and
|
||||||
|
"recipients" may be individuals or organizations.
|
||||||
|
|
||||||
|
To "modify" a work means to copy from or adapt all or part of the work
|
||||||
|
in a fashion requiring copyright permission, other than the making of an
|
||||||
|
exact copy. The resulting work is called a "modified version" of the
|
||||||
|
earlier work or a work "based on" the earlier work.
|
||||||
|
|
||||||
|
A "covered work" means either the unmodified Program or a work based
|
||||||
|
on the Program.
|
||||||
|
|
||||||
|
To "propagate" a work means to do anything with it that, without
|
||||||
|
permission, would make you directly or secondarily liable for
|
||||||
|
infringement under applicable copyright law, except executing it on a
|
||||||
|
computer or modifying a private copy. Propagation includes copying,
|
||||||
|
distribution (with or without modification), making available to the
|
||||||
|
public, and in some countries other activities as well.
|
||||||
|
|
||||||
|
To "convey" a work means any kind of propagation that enables other
|
||||||
|
parties to make or receive copies. Mere interaction with a user through
|
||||||
|
a computer network, with no transfer of a copy, is not conveying.
|
||||||
|
|
||||||
|
An interactive user interface displays "Appropriate Legal Notices"
|
||||||
|
to the extent that it includes a convenient and prominently visible
|
||||||
|
feature that (1) displays an appropriate copyright notice, and (2)
|
||||||
|
tells the user that there is no warranty for the work (except to the
|
||||||
|
extent that warranties are provided), that licensees may convey the
|
||||||
|
work under this License, and how to view a copy of this License. If
|
||||||
|
the interface presents a list of user commands or options, such as a
|
||||||
|
menu, a prominent item in the list meets this criterion.
|
||||||
|
|
||||||
|
1. Source Code.
|
||||||
|
|
||||||
|
The "source code" for a work means the preferred form of the work
|
||||||
|
for making modifications to it. "Object code" means any non-source
|
||||||
|
form of a work.
|
||||||
|
|
||||||
|
A "Standard Interface" means an interface that either is an official
|
||||||
|
standard defined by a recognized standards body, or, in the case of
|
||||||
|
interfaces specified for a particular programming language, one that
|
||||||
|
is widely used among developers working in that language.
|
||||||
|
|
||||||
|
The "System Libraries" of an executable work include anything, other
|
||||||
|
than the work as a whole, that (a) is included in the normal form of
|
||||||
|
packaging a Major Component, but which is not part of that Major
|
||||||
|
Component, and (b) serves only to enable use of the work with that
|
||||||
|
Major Component, or to implement a Standard Interface for which an
|
||||||
|
implementation is available to the public in source code form. A
|
||||||
|
"Major Component", in this context, means a major essential component
|
||||||
|
(kernel, window system, and so on) of the specific operating system
|
||||||
|
(if any) on which the executable work runs, or a compiler used to
|
||||||
|
produce the work, or an object code interpreter used to run it.
|
||||||
|
|
||||||
|
The "Corresponding Source" for a work in object code form means all
|
||||||
|
the source code needed to generate, install, and (for an executable
|
||||||
|
work) run the object code and to modify the work, including scripts to
|
||||||
|
control those activities. However, it does not include the work's
|
||||||
|
System Libraries, or general-purpose tools or generally available free
|
||||||
|
programs which are used unmodified in performing those activities but
|
||||||
|
which are not part of the work. For example, Corresponding Source
|
||||||
|
includes interface definition files associated with source files for
|
||||||
|
the work, and the source code for shared libraries and dynamically
|
||||||
|
linked subprograms that the work is specifically designed to require,
|
||||||
|
such as by intimate data communication or control flow between those
|
||||||
|
subprograms and other parts of the work.
|
||||||
|
|
||||||
|
The Corresponding Source need not include anything that users
|
||||||
|
can regenerate automatically from other parts of the Corresponding
|
||||||
|
Source.
|
||||||
|
|
||||||
|
The Corresponding Source for a work in source code form is that
|
||||||
|
same work.
|
||||||
|
|
||||||
|
2. Basic Permissions.
|
||||||
|
|
||||||
|
All rights granted under this License are granted for the term of
|
||||||
|
copyright on the Program, and are irrevocable provided the stated
|
||||||
|
conditions are met. This License explicitly affirms your unlimited
|
||||||
|
permission to run the unmodified Program. The output from running a
|
||||||
|
covered work is covered by this License only if the output, given its
|
||||||
|
content, constitutes a covered work. This License acknowledges your
|
||||||
|
rights of fair use or other equivalent, as provided by copyright law.
|
||||||
|
|
||||||
|
You may make, run and propagate covered works that you do not
|
||||||
|
convey, without conditions so long as your license otherwise remains
|
||||||
|
in force. You may convey covered works to others for the sole purpose
|
||||||
|
of having them make modifications exclusively for you, or provide you
|
||||||
|
with facilities for running those works, provided that you comply with
|
||||||
|
the terms of this License in conveying all material for which you do
|
||||||
|
not control copyright. Those thus making or running the covered works
|
||||||
|
for you must do so exclusively on your behalf, under your direction
|
||||||
|
and control, on terms that prohibit them from making any copies of
|
||||||
|
your copyrighted material outside their relationship with you.
|
||||||
|
|
||||||
|
Conveying under any other circumstances is permitted solely under
|
||||||
|
the conditions stated below. Sublicensing is not allowed; section 10
|
||||||
|
makes it unnecessary.
|
||||||
|
|
||||||
|
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||||
|
|
||||||
|
No covered work shall be deemed part of an effective technological
|
||||||
|
measure under any applicable law fulfilling obligations under article
|
||||||
|
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||||
|
similar laws prohibiting or restricting circumvention of such
|
||||||
|
measures.
|
||||||
|
|
||||||
|
When you convey a covered work, you waive any legal power to forbid
|
||||||
|
circumvention of technological measures to the extent such circumvention
|
||||||
|
is effected by exercising rights under this License with respect to
|
||||||
|
the covered work, and you disclaim any intention to limit operation or
|
||||||
|
modification of the work as a means of enforcing, against the work's
|
||||||
|
users, your or third parties' legal rights to forbid circumvention of
|
||||||
|
technological measures.
|
||||||
|
|
||||||
|
4. Conveying Verbatim Copies.
|
||||||
|
|
||||||
|
You may convey verbatim copies of the Program's source code as you
|
||||||
|
receive it, in any medium, provided that you conspicuously and
|
||||||
|
appropriately publish on each copy an appropriate copyright notice;
|
||||||
|
keep intact all notices stating that this License and any
|
||||||
|
non-permissive terms added in accord with section 7 apply to the code;
|
||||||
|
keep intact all notices of the absence of any warranty; and give all
|
||||||
|
recipients a copy of this License along with the Program.
|
||||||
|
|
||||||
|
You may charge any price or no price for each copy that you convey,
|
||||||
|
and you may offer support or warranty protection for a fee.
|
||||||
|
|
||||||
|
5. Conveying Modified Source Versions.
|
||||||
|
|
||||||
|
You may convey a work based on the Program, or the modifications to
|
||||||
|
produce it from the Program, in the form of source code under the
|
||||||
|
terms of section 4, provided that you also meet all of these conditions:
|
||||||
|
|
||||||
|
a) The work must carry prominent notices stating that you modified
|
||||||
|
it, and giving a relevant date.
|
||||||
|
|
||||||
|
b) The work must carry prominent notices stating that it is
|
||||||
|
released under this License and any conditions added under section
|
||||||
|
7. This requirement modifies the requirement in section 4 to
|
||||||
|
"keep intact all notices".
|
||||||
|
|
||||||
|
c) You must license the entire work, as a whole, under this
|
||||||
|
License to anyone who comes into possession of a copy. This
|
||||||
|
License will therefore apply, along with any applicable section 7
|
||||||
|
additional terms, to the whole of the work, and all its parts,
|
||||||
|
regardless of how they are packaged. This License gives no
|
||||||
|
permission to license the work in any other way, but it does not
|
||||||
|
invalidate such permission if you have separately received it.
|
||||||
|
|
||||||
|
d) If the work has interactive user interfaces, each must display
|
||||||
|
Appropriate Legal Notices; however, if the Program has interactive
|
||||||
|
interfaces that do not display Appropriate Legal Notices, your
|
||||||
|
work need not make them do so.
|
||||||
|
|
||||||
|
A compilation of a covered work with other separate and independent
|
||||||
|
works, which are not by their nature extensions of the covered work,
|
||||||
|
and which are not combined with it such as to form a larger program,
|
||||||
|
in or on a volume of a storage or distribution medium, is called an
|
||||||
|
"aggregate" if the compilation and its resulting copyright are not
|
||||||
|
used to limit the access or legal rights of the compilation's users
|
||||||
|
beyond what the individual works permit. Inclusion of a covered work
|
||||||
|
in an aggregate does not cause this License to apply to the other
|
||||||
|
parts of the aggregate.
|
||||||
|
|
||||||
|
6. Conveying Non-Source Forms.
|
||||||
|
|
||||||
|
You may convey a covered work in object code form under the terms
|
||||||
|
of sections 4 and 5, provided that you also convey the
|
||||||
|
machine-readable Corresponding Source under the terms of this License,
|
||||||
|
in one of these ways:
|
||||||
|
|
||||||
|
a) Convey the object code in, or embodied in, a physical product
|
||||||
|
(including a physical distribution medium), accompanied by the
|
||||||
|
Corresponding Source fixed on a durable physical medium
|
||||||
|
customarily used for software interchange.
|
||||||
|
|
||||||
|
b) Convey the object code in, or embodied in, a physical product
|
||||||
|
(including a physical distribution medium), accompanied by a
|
||||||
|
written offer, valid for at least three years and valid for as
|
||||||
|
long as you offer spare parts or customer support for that product
|
||||||
|
model, to give anyone who possesses the object code either (1) a
|
||||||
|
copy of the Corresponding Source for all the software in the
|
||||||
|
product that is covered by this License, on a durable physical
|
||||||
|
medium customarily used for software interchange, for a price no
|
||||||
|
more than your reasonable cost of physically performing this
|
||||||
|
conveying of source, or (2) access to copy the
|
||||||
|
Corresponding Source from a network server at no charge.
|
||||||
|
|
||||||
|
c) Convey individual copies of the object code with a copy of the
|
||||||
|
written offer to provide the Corresponding Source. This
|
||||||
|
alternative is allowed only occasionally and noncommercially, and
|
||||||
|
only if you received the object code with such an offer, in accord
|
||||||
|
with subsection 6b.
|
||||||
|
|
||||||
|
d) Convey the object code by offering access from a designated
|
||||||
|
place (gratis or for a charge), and offer equivalent access to the
|
||||||
|
Corresponding Source in the same way through the same place at no
|
||||||
|
further charge. You need not require recipients to copy the
|
||||||
|
Corresponding Source along with the object code. If the place to
|
||||||
|
copy the object code is a network server, the Corresponding Source
|
||||||
|
may be on a different server (operated by you or a third party)
|
||||||
|
that supports equivalent copying facilities, provided you maintain
|
||||||
|
clear directions next to the object code saying where to find the
|
||||||
|
Corresponding Source. Regardless of what server hosts the
|
||||||
|
Corresponding Source, you remain obligated to ensure that it is
|
||||||
|
available for as long as needed to satisfy these requirements.
|
||||||
|
|
||||||
|
e) Convey the object code using peer-to-peer transmission, provided
|
||||||
|
you inform other peers where the object code and Corresponding
|
||||||
|
Source of the work are being offered to the general public at no
|
||||||
|
charge under subsection 6d.
|
||||||
|
|
||||||
|
A separable portion of the object code, whose source code is excluded
|
||||||
|
from the Corresponding Source as a System Library, need not be
|
||||||
|
included in conveying the object code work.
|
||||||
|
|
||||||
|
A "User Product" is either (1) a "consumer product", which means any
|
||||||
|
tangible personal property which is normally used for personal, family,
|
||||||
|
or household purposes, or (2) anything designed or sold for incorporation
|
||||||
|
into a dwelling. In determining whether a product is a consumer product,
|
||||||
|
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||||
|
product received by a particular user, "normally used" refers to a
|
||||||
|
typical or common use of that class of product, regardless of the status
|
||||||
|
of the particular user or of the way in which the particular user
|
||||||
|
actually uses, or expects or is expected to use, the product. A product
|
||||||
|
is a consumer product regardless of whether the product has substantial
|
||||||
|
commercial, industrial or non-consumer uses, unless such uses represent
|
||||||
|
the only significant mode of use of the product.
|
||||||
|
|
||||||
|
"Installation Information" for a User Product means any methods,
|
||||||
|
procedures, authorization keys, or other information required to install
|
||||||
|
and execute modified versions of a covered work in that User Product from
|
||||||
|
a modified version of its Corresponding Source. The information must
|
||||||
|
suffice to ensure that the continued functioning of the modified object
|
||||||
|
code is in no case prevented or interfered with solely because
|
||||||
|
modification has been made.
|
||||||
|
|
||||||
|
If you convey an object code work under this section in, or with, or
|
||||||
|
specifically for use in, a User Product, and the conveying occurs as
|
||||||
|
part of a transaction in which the right of possession and use of the
|
||||||
|
User Product is transferred to the recipient in perpetuity or for a
|
||||||
|
fixed term (regardless of how the transaction is characterized), the
|
||||||
|
Corresponding Source conveyed under this section must be accompanied
|
||||||
|
by the Installation Information. But this requirement does not apply
|
||||||
|
if neither you nor any third party retains the ability to install
|
||||||
|
modified object code on the User Product (for example, the work has
|
||||||
|
been installed in ROM).
|
||||||
|
|
||||||
|
The requirement to provide Installation Information does not include a
|
||||||
|
requirement to continue to provide support service, warranty, or updates
|
||||||
|
for a work that has been modified or installed by the recipient, or for
|
||||||
|
the User Product in which it has been modified or installed. Access to a
|
||||||
|
network may be denied when the modification itself materially and
|
||||||
|
adversely affects the operation of the network or violates the rules and
|
||||||
|
protocols for communication across the network.
|
||||||
|
|
||||||
|
Corresponding Source conveyed, and Installation Information provided,
|
||||||
|
in accord with this section must be in a format that is publicly
|
||||||
|
documented (and with an implementation available to the public in
|
||||||
|
source code form), and must require no special password or key for
|
||||||
|
unpacking, reading or copying.
|
||||||
|
|
||||||
|
7. Additional Terms.
|
||||||
|
|
||||||
|
"Additional permissions" are terms that supplement the terms of this
|
||||||
|
License by making exceptions from one or more of its conditions.
|
||||||
|
Additional permissions that are applicable to the entire Program shall
|
||||||
|
be treated as though they were included in this License, to the extent
|
||||||
|
that they are valid under applicable law. If additional permissions
|
||||||
|
apply only to part of the Program, that part may be used separately
|
||||||
|
under those permissions, but the entire Program remains governed by
|
||||||
|
this License without regard to the additional permissions.
|
||||||
|
|
||||||
|
When you convey a copy of a covered work, you may at your option
|
||||||
|
remove any additional permissions from that copy, or from any part of
|
||||||
|
it. (Additional permissions may be written to require their own
|
||||||
|
removal in certain cases when you modify the work.) You may place
|
||||||
|
additional permissions on material, added by you to a covered work,
|
||||||
|
for which you have or can give appropriate copyright permission.
|
||||||
|
|
||||||
|
Notwithstanding any other provision of this License, for material you
|
||||||
|
add to a covered work, you may (if authorized by the copyright holders of
|
||||||
|
that material) supplement the terms of this License with terms:
|
||||||
|
|
||||||
|
a) Disclaiming warranty or limiting liability differently from the
|
||||||
|
terms of sections 15 and 16 of this License; or
|
||||||
|
|
||||||
|
b) Requiring preservation of specified reasonable legal notices or
|
||||||
|
author attributions in that material or in the Appropriate Legal
|
||||||
|
Notices displayed by works containing it; or
|
||||||
|
|
||||||
|
c) Prohibiting misrepresentation of the origin of that material, or
|
||||||
|
requiring that modified versions of such material be marked in
|
||||||
|
reasonable ways as different from the original version; or
|
||||||
|
|
||||||
|
d) Limiting the use for publicity purposes of names of licensors or
|
||||||
|
authors of the material; or
|
||||||
|
|
||||||
|
e) Declining to grant rights under trademark law for use of some
|
||||||
|
trade names, trademarks, or service marks; or
|
||||||
|
|
||||||
|
f) Requiring indemnification of licensors and authors of that
|
||||||
|
material by anyone who conveys the material (or modified versions of
|
||||||
|
it) with contractual assumptions of liability to the recipient, for
|
||||||
|
any liability that these contractual assumptions directly impose on
|
||||||
|
those licensors and authors.
|
||||||
|
|
||||||
|
All other non-permissive additional terms are considered "further
|
||||||
|
restrictions" within the meaning of section 10. If the Program as you
|
||||||
|
received it, or any part of it, contains a notice stating that it is
|
||||||
|
governed by this License along with a term that is a further
|
||||||
|
restriction, you may remove that term. If a license document contains
|
||||||
|
a further restriction but permits relicensing or conveying under this
|
||||||
|
License, you may add to a covered work material governed by the terms
|
||||||
|
of that license document, provided that the further restriction does
|
||||||
|
not survive such relicensing or conveying.
|
||||||
|
|
||||||
|
If you add terms to a covered work in accord with this section, you
|
||||||
|
must place, in the relevant source files, a statement of the
|
||||||
|
additional terms that apply to those files, or a notice indicating
|
||||||
|
where to find the applicable terms.
|
||||||
|
|
||||||
|
Additional terms, permissive or non-permissive, may be stated in the
|
||||||
|
form of a separately written license, or stated as exceptions;
|
||||||
|
the above requirements apply either way.
|
||||||
|
|
||||||
|
8. Termination.
|
||||||
|
|
||||||
|
You may not propagate or modify a covered work except as expressly
|
||||||
|
provided under this License. Any attempt otherwise to propagate or
|
||||||
|
modify it is void, and will automatically terminate your rights under
|
||||||
|
this License (including any patent licenses granted under the third
|
||||||
|
paragraph of section 11).
|
||||||
|
|
||||||
|
However, if you cease all violation of this License, then your
|
||||||
|
license from a particular copyright holder is reinstated (a)
|
||||||
|
provisionally, unless and until the copyright holder explicitly and
|
||||||
|
finally terminates your license, and (b) permanently, if the copyright
|
||||||
|
holder fails to notify you of the violation by some reasonable means
|
||||||
|
prior to 60 days after the cessation.
|
||||||
|
|
||||||
|
Moreover, your license from a particular copyright holder is
|
||||||
|
reinstated permanently if the copyright holder notifies you of the
|
||||||
|
violation by some reasonable means, this is the first time you have
|
||||||
|
received notice of violation of this License (for any work) from that
|
||||||
|
copyright holder, and you cure the violation prior to 30 days after
|
||||||
|
your receipt of the notice.
|
||||||
|
|
||||||
|
Termination of your rights under this section does not terminate the
|
||||||
|
licenses of parties who have received copies or rights from you under
|
||||||
|
this License. If your rights have been terminated and not permanently
|
||||||
|
reinstated, you do not qualify to receive new licenses for the same
|
||||||
|
material under section 10.
|
||||||
|
|
||||||
|
9. Acceptance Not Required for Having Copies.
|
||||||
|
|
||||||
|
You are not required to accept this License in order to receive or
|
||||||
|
run a copy of the Program. Ancillary propagation of a covered work
|
||||||
|
occurring solely as a consequence of using peer-to-peer transmission
|
||||||
|
to receive a copy likewise does not require acceptance. However,
|
||||||
|
nothing other than this License grants you permission to propagate or
|
||||||
|
modify any covered work. These actions infringe copyright if you do
|
||||||
|
not accept this License. Therefore, by modifying or propagating a
|
||||||
|
covered work, you indicate your acceptance of this License to do so.
|
||||||
|
|
||||||
|
10. Automatic Licensing of Downstream Recipients.
|
||||||
|
|
||||||
|
Each time you convey a covered work, the recipient automatically
|
||||||
|
receives a license from the original licensors, to run, modify and
|
||||||
|
propagate that work, subject to this License. You are not responsible
|
||||||
|
for enforcing compliance by third parties with this License.
|
||||||
|
|
||||||
|
An "entity transaction" is a transaction transferring control of an
|
||||||
|
organization, or substantially all assets of one, or subdividing an
|
||||||
|
organization, or merging organizations. If propagation of a covered
|
||||||
|
work results from an entity transaction, each party to that
|
||||||
|
transaction who receives a copy of the work also receives whatever
|
||||||
|
licenses to the work the party's predecessor in interest had or could
|
||||||
|
give under the previous paragraph, plus a right to possession of the
|
||||||
|
Corresponding Source of the work from the predecessor in interest, if
|
||||||
|
the predecessor has it or can get it with reasonable efforts.
|
||||||
|
|
||||||
|
You may not impose any further restrictions on the exercise of the
|
||||||
|
rights granted or affirmed under this License. For example, you may
|
||||||
|
not impose a license fee, royalty, or other charge for exercise of
|
||||||
|
rights granted under this License, and you may not initiate litigation
|
||||||
|
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||||
|
any patent claim is infringed by making, using, selling, offering for
|
||||||
|
sale, or importing the Program or any portion of it.
|
||||||
|
|
||||||
|
11. Patents.
|
||||||
|
|
||||||
|
A "contributor" is a copyright holder who authorizes use under this
|
||||||
|
License of the Program or a work on which the Program is based. The
|
||||||
|
work thus licensed is called the contributor's "contributor version".
|
||||||
|
|
||||||
|
A contributor's "essential patent claims" are all patent claims
|
||||||
|
owned or controlled by the contributor, whether already acquired or
|
||||||
|
hereafter acquired, that would be infringed by some manner, permitted
|
||||||
|
by this License, of making, using, or selling its contributor version,
|
||||||
|
but do not include claims that would be infringed only as a
|
||||||
|
consequence of further modification of the contributor version. For
|
||||||
|
purposes of this definition, "control" includes the right to grant
|
||||||
|
patent sublicenses in a manner consistent with the requirements of
|
||||||
|
this License.
|
||||||
|
|
||||||
|
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||||
|
patent license under the contributor's essential patent claims, to
|
||||||
|
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||||
|
propagate the contents of its contributor version.
|
||||||
|
|
||||||
|
In the following three paragraphs, a "patent license" is any express
|
||||||
|
agreement or commitment, however denominated, not to enforce a patent
|
||||||
|
(such as an express permission to practice a patent or covenant not to
|
||||||
|
sue for patent infringement). To "grant" such a patent license to a
|
||||||
|
party means to make such an agreement or commitment not to enforce a
|
||||||
|
patent against the party.
|
||||||
|
|
||||||
|
If you convey a covered work, knowingly relying on a patent license,
|
||||||
|
and the Corresponding Source of the work is not available for anyone
|
||||||
|
to copy, free of charge and under the terms of this License, through a
|
||||||
|
publicly available network server or other readily accessible means,
|
||||||
|
then you must either (1) cause the Corresponding Source to be so
|
||||||
|
available, or (2) arrange to deprive yourself of the benefit of the
|
||||||
|
patent license for this particular work, or (3) arrange, in a manner
|
||||||
|
consistent with the requirements of this License, to extend the patent
|
||||||
|
license to downstream recipients. "Knowingly relying" means you have
|
||||||
|
actual knowledge that, but for the patent license, your conveying the
|
||||||
|
covered work in a country, or your recipient's use of the covered work
|
||||||
|
in a country, would infringe one or more identifiable patents in that
|
||||||
|
country that you have reason to believe are valid.
|
||||||
|
|
||||||
|
If, pursuant to or in connection with a single transaction or
|
||||||
|
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||||
|
covered work, and grant a patent license to some of the parties
|
||||||
|
receiving the covered work authorizing them to use, propagate, modify
|
||||||
|
or convey a specific copy of the covered work, then the patent license
|
||||||
|
you grant is automatically extended to all recipients of the covered
|
||||||
|
work and works based on it.
|
||||||
|
|
||||||
|
A patent license is "discriminatory" if it does not include within
|
||||||
|
the scope of its coverage, prohibits the exercise of, or is
|
||||||
|
conditioned on the non-exercise of one or more of the rights that are
|
||||||
|
specifically granted under this License. You may not convey a covered
|
||||||
|
work if you are a party to an arrangement with a third party that is
|
||||||
|
in the business of distributing software, under which you make payment
|
||||||
|
to the third party based on the extent of your activity of conveying
|
||||||
|
the work, and under which the third party grants, to any of the
|
||||||
|
parties who would receive the covered work from you, a discriminatory
|
||||||
|
patent license (a) in connection with copies of the covered work
|
||||||
|
conveyed by you (or copies made from those copies), or (b) primarily
|
||||||
|
for and in connection with specific products or compilations that
|
||||||
|
contain the covered work, unless you entered into that arrangement,
|
||||||
|
or that patent license was granted, prior to 28 March 2007.
|
||||||
|
|
||||||
|
Nothing in this License shall be construed as excluding or limiting
|
||||||
|
any implied license or other defenses to infringement that may
|
||||||
|
otherwise be available to you under applicable patent law.
|
||||||
|
|
||||||
|
12. No Surrender of Others' Freedom.
|
||||||
|
|
||||||
|
If conditions are imposed on you (whether by court order, agreement or
|
||||||
|
otherwise) that contradict the conditions of this License, they do not
|
||||||
|
excuse you from the conditions of this License. If you cannot convey a
|
||||||
|
covered work so as to satisfy simultaneously your obligations under this
|
||||||
|
License and any other pertinent obligations, then as a consequence you may
|
||||||
|
not convey it at all. For example, if you agree to terms that obligate you
|
||||||
|
to collect a royalty for further conveying from those to whom you convey
|
||||||
|
the Program, the only way you could satisfy both those terms and this
|
||||||
|
License would be to refrain entirely from conveying the Program.
|
||||||
|
|
||||||
|
13. Use with the GNU Affero General Public License.
|
||||||
|
|
||||||
|
Notwithstanding any other provision of this License, you have
|
||||||
|
permission to link or combine any covered work with a work licensed
|
||||||
|
under version 3 of the GNU Affero General Public License into a single
|
||||||
|
combined work, and to convey the resulting work. The terms of this
|
||||||
|
License will continue to apply to the part which is the covered work,
|
||||||
|
but the special requirements of the GNU Affero General Public License,
|
||||||
|
section 13, concerning interaction through a network will apply to the
|
||||||
|
combination as such.
|
||||||
|
|
||||||
|
14. Revised Versions of this License.
|
||||||
|
|
||||||
|
The Free Software Foundation may publish revised and/or new versions of
|
||||||
|
the GNU General Public License from time to time. Such new versions will
|
||||||
|
be similar in spirit to the present version, but may differ in detail to
|
||||||
|
address new problems or concerns.
|
||||||
|
|
||||||
|
Each version is given a distinguishing version number. If the
|
||||||
|
Program specifies that a certain numbered version of the GNU General
|
||||||
|
Public License "or any later version" applies to it, you have the
|
||||||
|
option of following the terms and conditions either of that numbered
|
||||||
|
version or of any later version published by the Free Software
|
||||||
|
Foundation. If the Program does not specify a version number of the
|
||||||
|
GNU General Public License, you may choose any version ever published
|
||||||
|
by the Free Software Foundation.
|
||||||
|
|
||||||
|
If the Program specifies that a proxy can decide which future
|
||||||
|
versions of the GNU General Public License can be used, that proxy's
|
||||||
|
public statement of acceptance of a version permanently authorizes you
|
||||||
|
to choose that version for the Program.
|
||||||
|
|
||||||
|
Later license versions may give you additional or different
|
||||||
|
permissions. However, no additional obligations are imposed on any
|
||||||
|
author or copyright holder as a result of your choosing to follow a
|
||||||
|
later version.
|
||||||
|
|
||||||
|
15. Disclaimer of Warranty.
|
||||||
|
|
||||||
|
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||||
|
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||||
|
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||||
|
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||||
|
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||||
|
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||||
|
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||||
|
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||||
|
|
||||||
|
16. Limitation of Liability.
|
||||||
|
|
||||||
|
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||||
|
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||||
|
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||||
|
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||||
|
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||||
|
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||||
|
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||||
|
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||||
|
SUCH DAMAGES.
|
||||||
|
|
||||||
|
17. Interpretation of Sections 15 and 16.
|
||||||
|
|
||||||
|
If the disclaimer of warranty and limitation of liability provided
|
||||||
|
above cannot be given local legal effect according to their terms,
|
||||||
|
reviewing courts shall apply local law that most closely approximates
|
||||||
|
an absolute waiver of all civil liability in connection with the
|
||||||
|
Program, unless a warranty or assumption of liability accompanies a
|
||||||
|
copy of the Program in return for a fee.
|
||||||
|
|
||||||
|
END OF TERMS AND CONDITIONS
|
||||||
|
|
||||||
|
How to Apply These Terms to Your New Programs
|
||||||
|
|
||||||
|
If you develop a new program, and you want it to be of the greatest
|
||||||
|
possible use to the public, the best way to achieve this is to make it
|
||||||
|
free software which everyone can redistribute and change under these terms.
|
||||||
|
|
||||||
|
To do so, attach the following notices to the program. It is safest
|
||||||
|
to attach them to the start of each source file to most effectively
|
||||||
|
state the exclusion of warranty; and each file should have at least
|
||||||
|
the "copyright" line and a pointer to where the full notice is found.
|
||||||
|
|
||||||
|
<one line to give the program's name and a brief idea of what it does.>
|
||||||
|
Copyright (C) <year> <name of author>
|
||||||
|
|
||||||
|
This program is free software: you can redistribute it and/or modify
|
||||||
|
it under the terms of the GNU General Public License as published by
|
||||||
|
the Free Software Foundation, either version 3 of the License, or
|
||||||
|
(at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
GNU General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU General Public License
|
||||||
|
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
Also add information on how to contact you by electronic and paper mail.
|
||||||
|
|
||||||
|
If the program does terminal interaction, make it output a short
|
||||||
|
notice like this when it starts in an interactive mode:
|
||||||
|
|
||||||
|
<program> Copyright (C) <year> <name of author>
|
||||||
|
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||||
|
This is free software, and you are welcome to redistribute it
|
||||||
|
under certain conditions; type `show c' for details.
|
||||||
|
|
||||||
|
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||||
|
parts of the General Public License. Of course, your program's commands
|
||||||
|
might be different; for a GUI interface, you would use an "about box".
|
||||||
|
|
||||||
|
You should also get your employer (if you work as a programmer) or school,
|
||||||
|
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||||
|
For more information on this, and how to apply and follow the GNU GPL, see
|
||||||
|
<https://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
The GNU General Public License does not permit incorporating your program
|
||||||
|
into proprietary programs. If your program is a subroutine library, you
|
||||||
|
may consider it more useful to permit linking proprietary applications with
|
||||||
|
the library. If this is what you want to do, use the GNU Lesser General
|
||||||
|
Public License instead of this License. But first, please read
|
||||||
|
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
167
libs/QuickDigest5/quickdigest5.cpp
Normal file
167
libs/QuickDigest5/quickdigest5.cpp
Normal file
@@ -0,0 +1,167 @@
|
|||||||
|
/*
|
||||||
|
* Copyright (c) 2024 - Nathanne Isip
|
||||||
|
* This file is part of QuickDigest5.
|
||||||
|
*
|
||||||
|
* N8 is free software: you can redistribute it and/or modify
|
||||||
|
* it under the terms of the GNU General Public License as published
|
||||||
|
* by the Free Software Foundation, either version 3 of the License,
|
||||||
|
* or (at your option) any later version.
|
||||||
|
*
|
||||||
|
* N8 is distributed in the hope that it will be useful, but
|
||||||
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
* GNU General Public License for more details.
|
||||||
|
*
|
||||||
|
* You should have received a copy of the GNU General Public License
|
||||||
|
* along with N8. If not, see <https://www.gnu.org/licenses/>.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @file QuickDigest5.hpp
|
||||||
|
* @author [Nathanne Isip](https://github.com/nthnn)
|
||||||
|
* @brief A header file for the QuickDigest5 class, a utility for MD5 hashing.
|
||||||
|
*
|
||||||
|
* This file defines the `QuickDigest5` class, which provides functionalities
|
||||||
|
* for computing MD5 hashes of strings and files. The class also includes
|
||||||
|
* static methods for converting the computed hash to a string representation.
|
||||||
|
*
|
||||||
|
* @note This class is designed as a final class and cannot be inherited.
|
||||||
|
*/
|
||||||
|
#ifndef QUICKDIGEST5_HPP
|
||||||
|
#define QUICKDIGEST5_HPP
|
||||||
|
|
||||||
|
#include <cstdint>
|
||||||
|
#include <fstream>
|
||||||
|
#include <iomanip>
|
||||||
|
#include <sstream>
|
||||||
|
#include <string>
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @class QuickDigest5
|
||||||
|
* @brief A utility class for MD5 hashing of strings and files.
|
||||||
|
*
|
||||||
|
* The `QuickDigest5` class provides methods to compute MD5 hashes
|
||||||
|
* for input strings and files, as well as converting the hash
|
||||||
|
* to a hexadecimal string representation. This class encapsulates
|
||||||
|
* the internal MD5 computation logic and exposes static methods
|
||||||
|
* for ease of use.
|
||||||
|
*
|
||||||
|
* @note This class is marked `final` and cannot be subclassed.
|
||||||
|
*/
|
||||||
|
class QuickDigest5 final {
|
||||||
|
private:
|
||||||
|
/**
|
||||||
|
* @brief Size of the input in bytes.
|
||||||
|
*/
|
||||||
|
uint64_t size;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Buffer for the MD5 computation.
|
||||||
|
*/
|
||||||
|
std::vector<uint32_t> buffer;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Input data to be processed for MD5 hashing.
|
||||||
|
*/
|
||||||
|
std::vector<uint8_t> input;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Stores the resulting MD5 hash.
|
||||||
|
*/
|
||||||
|
std::vector<uint8_t> digest;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Padding used during MD5 computation.
|
||||||
|
*
|
||||||
|
* A static array defining the padding values required
|
||||||
|
* to align the input data to a 512-bit boundary.
|
||||||
|
*/
|
||||||
|
static uint8_t padding[64];
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Shift values used during MD5 computation.
|
||||||
|
*
|
||||||
|
* A static array defining the shift amounts for each
|
||||||
|
* step of the MD5 algorithm.
|
||||||
|
*/
|
||||||
|
static uint32_t shift[64];
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Precomputed sine-derived constants.
|
||||||
|
*
|
||||||
|
* A static array of constants derived from the fractional part
|
||||||
|
* of sine values, used in the MD5 algorithm.
|
||||||
|
*/
|
||||||
|
static uint32_t sineDerivation[64];
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Finalizes the MD5 computation.
|
||||||
|
*
|
||||||
|
* This method performs any final transformations required
|
||||||
|
* to complete the MD5 hash computation.
|
||||||
|
*/
|
||||||
|
void finalize();
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Processes a single 512-bit block of input data.
|
||||||
|
*
|
||||||
|
* @param inputVec A vector containing the input data to process.
|
||||||
|
*/
|
||||||
|
void step(const std::vector<uint32_t>& inputVec);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Updates the internal state with input data.
|
||||||
|
*
|
||||||
|
* @param inputBuffer A pointer to the input data buffer.
|
||||||
|
* @param inputLength The length of the input data in bytes.
|
||||||
|
*/
|
||||||
|
void update(
|
||||||
|
const uint8_t* inputBuffer,
|
||||||
|
size_t inputLength
|
||||||
|
);
|
||||||
|
|
||||||
|
protected:
|
||||||
|
/**
|
||||||
|
* @brief Constructs a `QuickDigest5` object.
|
||||||
|
*
|
||||||
|
* The constructor is protected to prevent direct instantiation.
|
||||||
|
* Users should rely on the static methods provided by the class.
|
||||||
|
*/
|
||||||
|
QuickDigest5();
|
||||||
|
|
||||||
|
public:
|
||||||
|
/**
|
||||||
|
* @brief Computes the MD5 hash of a string.
|
||||||
|
*
|
||||||
|
* @param input The input string to hash.
|
||||||
|
* @return A vector of bytes representing the MD5 hash.
|
||||||
|
*/
|
||||||
|
static std::vector<uint8_t> digestString(const std::string& input);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Computes the MD5 hash of a file.
|
||||||
|
*
|
||||||
|
* @param filepath The path to the file to hash.
|
||||||
|
* @return A vector of bytes representing the MD5 hash.
|
||||||
|
*/
|
||||||
|
static std::vector<uint8_t> digestFile(const std::string& filepath);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Computes the MD5 hash of a string and returns it as a hex string.
|
||||||
|
*
|
||||||
|
* @param input The input string to hash.
|
||||||
|
* @return A string representing the MD5 hash in hexadecimal format.
|
||||||
|
*/
|
||||||
|
static std::string toHash(const std::string& input);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Computes the MD5 hash of a file and returns it as a hex string.
|
||||||
|
*
|
||||||
|
* @param filepath The path to the file to hash.
|
||||||
|
* @return A string representing the MD5 hash in hexadecimal format.
|
||||||
|
*/
|
||||||
|
static std::string fileToHash(const std::string& filepath);
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif
|
167
libs/QuickDigest5/quickdigest5.hpp
Normal file
167
libs/QuickDigest5/quickdigest5.hpp
Normal file
@@ -0,0 +1,167 @@
|
|||||||
|
/*
|
||||||
|
* Copyright (c) 2024 - Nathanne Isip
|
||||||
|
* This file is part of QuickDigest5.
|
||||||
|
*
|
||||||
|
* N8 is free software: you can redistribute it and/or modify
|
||||||
|
* it under the terms of the GNU General Public License as published
|
||||||
|
* by the Free Software Foundation, either version 3 of the License,
|
||||||
|
* or (at your option) any later version.
|
||||||
|
*
|
||||||
|
* N8 is distributed in the hope that it will be useful, but
|
||||||
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
* GNU General Public License for more details.
|
||||||
|
*
|
||||||
|
* You should have received a copy of the GNU General Public License
|
||||||
|
* along with N8. If not, see <https://www.gnu.org/licenses/>.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @file QuickDigest5.hpp
|
||||||
|
* @author [Nathanne Isip](https://github.com/nthnn)
|
||||||
|
* @brief A header file for the QuickDigest5 class, a utility for MD5 hashing.
|
||||||
|
*
|
||||||
|
* This file defines the `QuickDigest5` class, which provides functionalities
|
||||||
|
* for computing MD5 hashes of strings and files. The class also includes
|
||||||
|
* static methods for converting the computed hash to a string representation.
|
||||||
|
*
|
||||||
|
* @note This class is designed as a final class and cannot be inherited.
|
||||||
|
*/
|
||||||
|
#ifndef QUICKDIGEST5_HPP
|
||||||
|
#define QUICKDIGEST5_HPP
|
||||||
|
|
||||||
|
#include <cstdint>
|
||||||
|
#include <fstream>
|
||||||
|
#include <iomanip>
|
||||||
|
#include <sstream>
|
||||||
|
#include <string>
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @class QuickDigest5
|
||||||
|
* @brief A utility class for MD5 hashing of strings and files.
|
||||||
|
*
|
||||||
|
* The `QuickDigest5` class provides methods to compute MD5 hashes
|
||||||
|
* for input strings and files, as well as converting the hash
|
||||||
|
* to a hexadecimal string representation. This class encapsulates
|
||||||
|
* the internal MD5 computation logic and exposes static methods
|
||||||
|
* for ease of use.
|
||||||
|
*
|
||||||
|
* @note This class is marked `final` and cannot be subclassed.
|
||||||
|
*/
|
||||||
|
class QuickDigest5 final {
|
||||||
|
private:
|
||||||
|
/**
|
||||||
|
* @brief Size of the input in bytes.
|
||||||
|
*/
|
||||||
|
uint64_t size;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Buffer for the MD5 computation.
|
||||||
|
*/
|
||||||
|
std::vector<uint32_t> buffer;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Input data to be processed for MD5 hashing.
|
||||||
|
*/
|
||||||
|
std::vector<uint8_t> input;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Stores the resulting MD5 hash.
|
||||||
|
*/
|
||||||
|
std::vector<uint8_t> digest;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Padding used during MD5 computation.
|
||||||
|
*
|
||||||
|
* A static array defining the padding values required
|
||||||
|
* to align the input data to a 512-bit boundary.
|
||||||
|
*/
|
||||||
|
static uint8_t padding[64];
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Shift values used during MD5 computation.
|
||||||
|
*
|
||||||
|
* A static array defining the shift amounts for each
|
||||||
|
* step of the MD5 algorithm.
|
||||||
|
*/
|
||||||
|
static uint32_t shift[64];
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Precomputed sine-derived constants.
|
||||||
|
*
|
||||||
|
* A static array of constants derived from the fractional part
|
||||||
|
* of sine values, used in the MD5 algorithm.
|
||||||
|
*/
|
||||||
|
static uint32_t sineDerivation[64];
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Finalizes the MD5 computation.
|
||||||
|
*
|
||||||
|
* This method performs any final transformations required
|
||||||
|
* to complete the MD5 hash computation.
|
||||||
|
*/
|
||||||
|
void finalize();
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Processes a single 512-bit block of input data.
|
||||||
|
*
|
||||||
|
* @param inputVec A vector containing the input data to process.
|
||||||
|
*/
|
||||||
|
void step(const std::vector<uint32_t>& inputVec);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Updates the internal state with input data.
|
||||||
|
*
|
||||||
|
* @param inputBuffer A pointer to the input data buffer.
|
||||||
|
* @param inputLength The length of the input data in bytes.
|
||||||
|
*/
|
||||||
|
void update(
|
||||||
|
const uint8_t* inputBuffer,
|
||||||
|
size_t inputLength
|
||||||
|
);
|
||||||
|
|
||||||
|
protected:
|
||||||
|
/**
|
||||||
|
* @brief Constructs a `QuickDigest5` object.
|
||||||
|
*
|
||||||
|
* The constructor is protected to prevent direct instantiation.
|
||||||
|
* Users should rely on the static methods provided by the class.
|
||||||
|
*/
|
||||||
|
QuickDigest5();
|
||||||
|
|
||||||
|
public:
|
||||||
|
/**
|
||||||
|
* @brief Computes the MD5 hash of a string.
|
||||||
|
*
|
||||||
|
* @param input The input string to hash.
|
||||||
|
* @return A vector of bytes representing the MD5 hash.
|
||||||
|
*/
|
||||||
|
static std::vector<uint8_t> digestString(const std::string& input);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Computes the MD5 hash of a file.
|
||||||
|
*
|
||||||
|
* @param filepath The path to the file to hash.
|
||||||
|
* @return A vector of bytes representing the MD5 hash.
|
||||||
|
*/
|
||||||
|
static std::vector<uint8_t> digestFile(const std::string& filepath);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Computes the MD5 hash of a string and returns it as a hex string.
|
||||||
|
*
|
||||||
|
* @param input The input string to hash.
|
||||||
|
* @return A string representing the MD5 hash in hexadecimal format.
|
||||||
|
*/
|
||||||
|
static std::string toHash(const std::string& input);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Computes the MD5 hash of a file and returns it as a hex string.
|
||||||
|
*
|
||||||
|
* @param filepath The path to the file to hash.
|
||||||
|
* @return A string representing the MD5 hash in hexadecimal format.
|
||||||
|
*/
|
||||||
|
static std::string fileToHash(const std::string& filepath);
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif
|
@@ -1,4 +1,4 @@
|
|||||||
#include "../Main.hpp"
|
#include "Main.hpp"
|
||||||
#include <exception>
|
#include <exception>
|
||||||
#include <iostream>
|
#include <iostream>
|
||||||
|
|
56
src/HTTP.cpp
Normal file
56
src/HTTP.cpp
Normal file
@@ -0,0 +1,56 @@
|
|||||||
|
#include "Helpers.hpp"
|
||||||
|
#include "Main.hpp"
|
||||||
|
|
||||||
|
void HTTPrequest::start() {
|
||||||
|
// Possible Logging here
|
||||||
|
processHTTPHeader();
|
||||||
|
}
|
||||||
|
|
||||||
|
void HTTPrequest::processRequest(
|
||||||
|
std::string requestType, std::string requestPath,
|
||||||
|
std::unordered_map<std::string, std::string> request,
|
||||||
|
std::unordered_map<std::string, std::string> args) {
|
||||||
|
//
|
||||||
|
// This is where we will process requests
|
||||||
|
//
|
||||||
|
uint64_t pathHash = Helpers::Pathhash(requestPath);
|
||||||
|
|
||||||
|
// This is very much temp
|
||||||
|
if (requestType == "POST") {
|
||||||
|
switch (pathHash) {
|
||||||
|
case "/upload"_hash:
|
||||||
|
writeData(Helpers::GenerateResponse("501 Not Implemented", "text/text",
|
||||||
|
"This path is not implemented yet!"));
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
// This can be further refactored to just "File send"
|
||||||
|
switch (pathHash) {
|
||||||
|
case "/"_hash:
|
||||||
|
writeData(Helpers::GenerateResponse("200 OK", "text/html",
|
||||||
|
Helpers::ReadFile("www/index.html")));
|
||||||
|
return;
|
||||||
|
default:
|
||||||
|
writeData(Helpers::GenerateResponse("404 Not Found", "text/html",
|
||||||
|
"Could not find that file!!"));
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void HTTPrequest::writeData(std::string data) {
|
||||||
|
//
|
||||||
|
// Response here
|
||||||
|
//
|
||||||
|
asio::async_write(sock, asio::buffer(data),
|
||||||
|
[](std::error_code, std::size_t) {});
|
||||||
|
}
|
||||||
|
|
||||||
|
// ================= CLASS HANDLING SPECIFIC =================
|
||||||
|
|
||||||
|
HTTPrequest::HTTPrequest(asio::io_context &context) : sock(context) {}
|
||||||
|
asio::ip::tcp::socket &HTTPrequest::socket() { return sock; }
|
||||||
|
HTTPrequest::HTTPrequest_ptr HTTPrequest::create(asio::io_context &context) {
|
||||||
|
return HTTPrequest_ptr(new HTTPrequest(context));
|
||||||
|
}
|
@@ -1,58 +0,0 @@
|
|||||||
#include "../Helpers.hpp"
|
|
||||||
#include "../Main.hpp"
|
|
||||||
#include <stdexcept>
|
|
||||||
|
|
||||||
void HTTPrequest::start() {
|
|
||||||
// Possible Logging here
|
|
||||||
processHTTPHeader();
|
|
||||||
}
|
|
||||||
|
|
||||||
void HTTPrequest::processRequest() {
|
|
||||||
try {
|
|
||||||
Webserver::responseMethods[requestType].at(requestPath)(this);
|
|
||||||
} catch (std::out_of_range &e) {
|
|
||||||
sendResponse("404 Not Found", "text/html",
|
|
||||||
Helpers::ReadFile("www/error.html"));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void HTTPrequest::sendResponse(std::string status, std::string mime,
|
|
||||||
std::string data) {
|
|
||||||
// Logging here perhaps
|
|
||||||
std::stringstream output;
|
|
||||||
output << "HTTP/1.1 " << status << "\r\n"
|
|
||||||
<< "Content-Type: " << mime << "\r\nContent-Length: " << data.size()
|
|
||||||
<< "\r\nConnection: close\r\n\r\n"
|
|
||||||
<< data;
|
|
||||||
|
|
||||||
// Idea here is that in TCP oncee you sent a shutdown you should read until
|
|
||||||
// EOF. When that happens, you know that the package is fully recieved
|
|
||||||
responseText = output.str();
|
|
||||||
asio::async_write(
|
|
||||||
sock, asio::buffer(responseText),
|
|
||||||
[this, self = shared_from_this()](std::error_code, std::size_t) {
|
|
||||||
sock.shutdown(asio::ip::tcp::socket::shutdown_send);
|
|
||||||
waitForClientClose();
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
// I'm not happy with this
|
|
||||||
void HTTPrequest::waitForClientClose() {
|
|
||||||
auto buf = std::array<char, 1>(); // I don't think there is a smaller possible
|
|
||||||
// constructor :(
|
|
||||||
sock.async_read_some(asio::buffer(buf),
|
|
||||||
[this, self = shared_from_this()](
|
|
||||||
const std::error_code &error, std::size_t) {
|
|
||||||
if (error) {
|
|
||||||
sock.close(); // This triggers when EOF
|
|
||||||
}
|
|
||||||
waitForClientClose(); // Ew recursion. Must fix.
|
|
||||||
});
|
|
||||||
}
|
|
||||||
// ================= CLASS HANDLING SPECIFIC =================
|
|
||||||
|
|
||||||
HTTPrequest::HTTPrequest(asio::io_context &context) : sock(context) {}
|
|
||||||
asio::ip::tcp::socket &HTTPrequest::socket() { return sock; }
|
|
||||||
HTTPrequest::HTTPrequest_ptr HTTPrequest::create(asio::io_context &context) {
|
|
||||||
return HTTPrequest_ptr(new HTTPrequest(context));
|
|
||||||
}
|
|
@@ -1,98 +0,0 @@
|
|||||||
#include "../Helpers.hpp"
|
|
||||||
#include "../Main.hpp"
|
|
||||||
#include <asio/impl/read.hpp>
|
|
||||||
#include <asio/impl/read_until.hpp>
|
|
||||||
#include <asio/socket_base.hpp>
|
|
||||||
#include <iostream>
|
|
||||||
#include <istream>
|
|
||||||
#include <string>
|
|
||||||
|
|
||||||
void HTTPrequest::processHTTPHeader() {
|
|
||||||
std::shared_ptr<HTTPrequest> self(shared_from_this());
|
|
||||||
|
|
||||||
asio::async_read_until(
|
|
||||||
sock, buffer, "\r\n\r\n",
|
|
||||||
[this, self](std::error_code error, std::size_t packageSize) {
|
|
||||||
if (!error) {
|
|
||||||
std::istream stream(&buffer);
|
|
||||||
|
|
||||||
// Process request line
|
|
||||||
std::string rq;
|
|
||||||
std::getline(stream, requestType, ' '); // HTTP request type
|
|
||||||
std::getline(stream, requestPath, ' '); // HTTP path
|
|
||||||
std::getline(stream, rq); // Version, omitting for now
|
|
||||||
|
|
||||||
processArgs();
|
|
||||||
processHeaderValues(stream);
|
|
||||||
processBody();
|
|
||||||
|
|
||||||
processRequest();
|
|
||||||
}
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
// ===================
|
|
||||||
// Inline Helpers
|
|
||||||
// ===================
|
|
||||||
|
|
||||||
void inline HTTPrequest::processArgs() {
|
|
||||||
std::string key, value;
|
|
||||||
if (requestPath.find('?') != std::string::npos) {
|
|
||||||
std::stringstream pathStream(requestPath);
|
|
||||||
std::getline(pathStream, requestPath, '?'); // Keeping the path pure
|
|
||||||
|
|
||||||
while (!pathStream.eof()) {
|
|
||||||
std::getline(pathStream, key, '=');
|
|
||||||
std::getline(pathStream, value, '&');
|
|
||||||
args.insert({key, value});
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// No lie AI generated this and I just adapted it
|
|
||||||
void inline HTTPrequest::processHeaderValues(std::basic_istream<char> &stream) {
|
|
||||||
std::string line;
|
|
||||||
while (std::getline(stream, line) && line != "\r") {
|
|
||||||
if (line.back() == '\r') {
|
|
||||||
|
|
||||||
line.pop_back();
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t colonPos = line.find(':');
|
|
||||||
if (colonPos != std::string::npos) {
|
|
||||||
std::string key = line.substr(0, colonPos);
|
|
||||||
std::string value = line.substr(colonPos + 1);
|
|
||||||
|
|
||||||
// Trim whitespace
|
|
||||||
value.erase(0, value.find_first_not_of(" \t"));
|
|
||||||
value.erase(value.find_last_not_of(" \t") + 1);
|
|
||||||
|
|
||||||
headers[key] = value;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// ===================
|
|
||||||
// BODY OF THE REQUEST
|
|
||||||
// ===================
|
|
||||||
|
|
||||||
void inline HTTPrequest::processBody() {
|
|
||||||
if (headers.find("Content-Length") != headers.end()) {
|
|
||||||
std::size_t uploadSize =
|
|
||||||
std::stoull(headers.at("Content-Length")) - buffer.size(),
|
|
||||||
octetCount = 0;
|
|
||||||
|
|
||||||
// This part needs to be sync since we want this specific instance
|
|
||||||
// execution to pause
|
|
||||||
if (octetCount < uploadSize) {
|
|
||||||
octetCount += asio::read(sock, buffer.prepare(uploadSize));
|
|
||||||
}
|
|
||||||
|
|
||||||
buffer.commit(octetCount);
|
|
||||||
std::istream bodyStream(&buffer);
|
|
||||||
bodyContent.resize(buffer.size());
|
|
||||||
bodyStream.read(bodyContent.data(), buffer.size());
|
|
||||||
|
|
||||||
buffer.consume(buffer.size()); // Just so the buffer is nice and clean
|
|
||||||
}
|
|
||||||
}
|
|
@@ -1,35 +0,0 @@
|
|||||||
#include "Helpers.hpp"
|
|
||||||
#include "Main.hpp"
|
|
||||||
#include <cstdint>
|
|
||||||
#include <iostream>
|
|
||||||
|
|
||||||
// Idea is very simple this map has it so that stuff like
|
|
||||||
// responseMethods["GET","/"] have a method inside them
|
|
||||||
// There is an invoking method inside each HTTPrequest
|
|
||||||
//
|
|
||||||
// So just add your logic here and relax ;)
|
|
||||||
std::unordered_map<
|
|
||||||
std::string,
|
|
||||||
std::unordered_map<std::string, std::function<void(HTTPrequest *self)>>>
|
|
||||||
Webserver::responseMethods;
|
|
||||||
|
|
||||||
void Webserver::initResponses() {
|
|
||||||
responseMethods["GET"]["/"] = [](HTTPrequest *self) {
|
|
||||||
self->sendResponse("200 OK", "text/html",
|
|
||||||
Helpers::ReadFile("www/index.html"));
|
|
||||||
};
|
|
||||||
|
|
||||||
responseMethods["POST"]["/upload"] = [](HTTPrequest *self) {
|
|
||||||
/*
|
|
||||||
auto result = Helpers::processFormData(self->bodyContent,
|
|
||||||
self->headers["Content-Type"]);
|
|
||||||
|
|
||||||
for (char c : self->bodyContent) {
|
|
||||||
std::cout << ((uint32_t)c) << " ";
|
|
||||||
}
|
|
||||||
std::cout << "\n\n" << std::flush;
|
|
||||||
|
|
||||||
*/
|
|
||||||
self->sendResponse("200 OK", "text/text", self->bodyContent);
|
|
||||||
};
|
|
||||||
}
|
|
89
src/HTTPRequestProcess.cpp
Normal file
89
src/HTTPRequestProcess.cpp
Normal file
@@ -0,0 +1,89 @@
|
|||||||
|
#include "Helpers.hpp"
|
||||||
|
#include "Main.hpp"
|
||||||
|
|
||||||
|
void HTTPrequest::processHTTPHeader() {
|
||||||
|
//
|
||||||
|
// Reading happens here
|
||||||
|
//
|
||||||
|
std::shared_ptr<HTTPrequest> self(shared_from_this());
|
||||||
|
|
||||||
|
// Sadly due to the nature of how asio works this entire logic needs to be
|
||||||
|
// mostly in 1 method I do wager that I could break off the whole body
|
||||||
|
// processing into its own thing as well as a lot of inline methods
|
||||||
|
// specifically for argument and header processing
|
||||||
|
|
||||||
|
// TODO: Remove boundary from the body. Do keep other stuff like
|
||||||
|
// file type and name
|
||||||
|
|
||||||
|
// HEADER read
|
||||||
|
asio::async_read_until(
|
||||||
|
sock, buffer, "\r\n\r\n", // its not the other way bud
|
||||||
|
[this, self](std::error_code error, std::size_t packageSize) {
|
||||||
|
if (!error) {
|
||||||
|
buffer.commit(packageSize);
|
||||||
|
std::unordered_map<std::string, std::string> request;
|
||||||
|
std::unordered_map<std::string, std::string> args;
|
||||||
|
std::istream stream(&buffer);
|
||||||
|
uint64_t octetCount = 0;
|
||||||
|
|
||||||
|
// This is HTTP main request
|
||||||
|
std::string rq, key, value, type, path;
|
||||||
|
|
||||||
|
Helpers::getlineAndCount(stream, octetCount, type,
|
||||||
|
' '); // HTTP request type
|
||||||
|
Helpers::getlineAndCount(stream, octetCount, path, ' '); // HTTP path
|
||||||
|
Helpers::getlineAndCount(stream, octetCount,
|
||||||
|
rq); // Version, omitting for now
|
||||||
|
|
||||||
|
// Quick stop to process arguments
|
||||||
|
if (path.find('?') != std::string::npos) {
|
||||||
|
std::stringstream pathStream(path);
|
||||||
|
std::getline(pathStream, path, '?'); // Keeping the path pure
|
||||||
|
|
||||||
|
while (!pathStream.eof()) {
|
||||||
|
std::getline(pathStream, key, '=');
|
||||||
|
std::getline(pathStream, value, '&');
|
||||||
|
args.insert({key, value});
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Rest of the request vals
|
||||||
|
while (octetCount <
|
||||||
|
packageSize - 2) { // -2 is due to last two \r\n\r\n combo
|
||||||
|
Helpers::getlineAndCount(stream, octetCount, key, ':');
|
||||||
|
Helpers::getlineAndCount(
|
||||||
|
stream, octetCount, rq,
|
||||||
|
' '); // trim start some gangster shit right here
|
||||||
|
Helpers::getlineAndCount(stream, octetCount, value);
|
||||||
|
request.insert({key, value});
|
||||||
|
}
|
||||||
|
|
||||||
|
// ===================
|
||||||
|
// BODY OF THE REQUEST
|
||||||
|
// ===================
|
||||||
|
if (request.find("Content-Length") != request.end()) {
|
||||||
|
std::size_t uploadSize = std::stoull(request.at("Content-Length")) -
|
||||||
|
buffer.size(),
|
||||||
|
octetCount = 0;
|
||||||
|
|
||||||
|
// This part needs to be sync since we want this specific instance
|
||||||
|
// execution to pause
|
||||||
|
while (octetCount < uploadSize) {
|
||||||
|
octetCount += asio::read(sock, buffer.prepare(uploadSize));
|
||||||
|
}
|
||||||
|
|
||||||
|
buffer.commit(octetCount);
|
||||||
|
std::istream bodyStream(&buffer);
|
||||||
|
std::string body;
|
||||||
|
body.resize(buffer.size());
|
||||||
|
bodyStream.read(body.data(), buffer.size());
|
||||||
|
|
||||||
|
buffer.consume(
|
||||||
|
buffer.size()); // Just so the buffer is nice and clean
|
||||||
|
}
|
||||||
|
|
||||||
|
processRequest(type, path, request, args); // This writes data too
|
||||||
|
sock.close();
|
||||||
|
}
|
||||||
|
});
|
||||||
|
}
|
34
src/Helpers.cpp
Normal file
34
src/Helpers.cpp
Normal file
@@ -0,0 +1,34 @@
|
|||||||
|
#include "Helpers.hpp"
|
||||||
|
#include <fstream>
|
||||||
|
#include <sstream>
|
||||||
|
#include <string>
|
||||||
|
|
||||||
|
// Should add caching here
|
||||||
|
std::string Helpers::ReadFile(std::string Path) {
|
||||||
|
std::ifstream file(Path);
|
||||||
|
std::stringstream contents;
|
||||||
|
contents << file.rdbuf();
|
||||||
|
file.close();
|
||||||
|
return contents.str();
|
||||||
|
}
|
||||||
|
|
||||||
|
void Helpers::getlineAndCount(std::basic_istream<char> &stream, uint64_t &count,
|
||||||
|
std::string &string, char delimit) {
|
||||||
|
if (delimit == '\0') {
|
||||||
|
std::getline(stream, string);
|
||||||
|
} else {
|
||||||
|
std::getline(stream, string, delimit);
|
||||||
|
}
|
||||||
|
count += string.size() + 1; // Delimiter
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
std::string Helpers::GenerateResponse(std::string statusCode,
|
||||||
|
std::string contentType,
|
||||||
|
std::string content) {
|
||||||
|
std::stringstream output;
|
||||||
|
output << "HTTP/1.1 " << statusCode << "\n"
|
||||||
|
<< "Content-Type: " << contentType
|
||||||
|
<< "\nContent-Length: " << content.size() << "\nConnection: close\n\n"
|
||||||
|
<< content;
|
||||||
|
return output.str();
|
||||||
|
}
|
@@ -1,17 +1,28 @@
|
|||||||
|
// Big thanks to
|
||||||
|
// https://medium.com/@ryan_forrester_/using-switch-statements-with-strings-in-c-a-complete-guide-efa12f64a59d
|
||||||
|
#include <cstddef>
|
||||||
|
#include <cstdint>
|
||||||
#include <string>
|
#include <string>
|
||||||
#include <unordered_map>
|
#include <string_view>
|
||||||
|
|
||||||
namespace Helpers {
|
namespace Helpers {
|
||||||
struct formData {
|
|
||||||
std::string data;
|
|
||||||
std::unordered_map<std::string, std::string> headers;
|
|
||||||
};
|
|
||||||
|
|
||||||
std::string ReadFile(std::string Path);
|
std::string ReadFile(std::string Path);
|
||||||
std::unordered_map<std::string, Helpers::formData>
|
void getlineAndCount(std::basic_istream<char> &stream, uint64_t &count,
|
||||||
processFormData(std::string data, std::string contentType);
|
std::string &string, char delimit = '\0');
|
||||||
namespace detail_processFormData {
|
std::string GenerateResponse(std::string statusCode, std::string contentType,
|
||||||
std::string inline getFieldName(const std::string &dataBlock);
|
std::string content);
|
||||||
std::string inline getBodyData(const std::string &dataBlock);
|
// ===========
|
||||||
} // namespace detail_processFormData
|
// Hashing
|
||||||
|
// ===========
|
||||||
|
// This is called a polynomial rolling hash, prob going to collide
|
||||||
|
constexpr uint64_t Pathhash(std::string_view s) {
|
||||||
|
uint64_t res = 0;
|
||||||
|
for (uint8_t c : s) {
|
||||||
|
res = (res * 131) + c;
|
||||||
|
}
|
||||||
|
return res;
|
||||||
|
}
|
||||||
} // namespace Helpers
|
} // namespace Helpers
|
||||||
|
constexpr uint64_t operator""_hash(const char *string, std::size_t count) {
|
||||||
|
return Helpers::Pathhash(std::string_view(string));
|
||||||
|
}
|
||||||
|
@@ -1,14 +0,0 @@
|
|||||||
#include "../Helpers.hpp"
|
|
||||||
#include <fstream>
|
|
||||||
#include <iostream>
|
|
||||||
#include <sstream>
|
|
||||||
#include <string>
|
|
||||||
|
|
||||||
// Should add caching here
|
|
||||||
std::string Helpers::ReadFile(std::string Path) {
|
|
||||||
std::ifstream file(Path);
|
|
||||||
std::stringstream contents;
|
|
||||||
contents << file.rdbuf();
|
|
||||||
file.close();
|
|
||||||
return contents.str();
|
|
||||||
}
|
|
@@ -1,70 +0,0 @@
|
|||||||
#include "../Helpers.hpp"
|
|
||||||
|
|
||||||
// FORM PROCESSOR
|
|
||||||
std::unordered_map<std::string, Helpers::formData>
|
|
||||||
Helpers::processFormData(std::string data, std::string contentType) {
|
|
||||||
std::unordered_map<std::string, Helpers::formData> formDataMap;
|
|
||||||
|
|
||||||
std::string boundary =
|
|
||||||
"--" +
|
|
||||||
contentType.substr(contentType.find('=') +
|
|
||||||
1); // Boundary for some fucking reason misses --
|
|
||||||
|
|
||||||
std::size_t currentPos = 0;
|
|
||||||
std::size_t nextBoundaryPos = 0;
|
|
||||||
|
|
||||||
while (nextBoundaryPos != std::string::npos) {
|
|
||||||
Helpers::formData fieldData;
|
|
||||||
|
|
||||||
// Find the current data block
|
|
||||||
std::size_t blockStart = currentPos + boundary.size() + 1; // +1 due to \n
|
|
||||||
nextBoundaryPos = data.find(boundary, blockStart);
|
|
||||||
|
|
||||||
std::size_t blockEnd =
|
|
||||||
(nextBoundaryPos != std::string::npos)
|
|
||||||
? nextBoundaryPos
|
|
||||||
: data.size() - boundary.size() - 3; // - 3 for final "--\n"
|
|
||||||
|
|
||||||
std::string dataBlock = data.substr(blockStart, blockEnd - blockStart);
|
|
||||||
std::string fieldName = detail_processFormData::getFieldName(dataBlock);
|
|
||||||
|
|
||||||
// Process headers
|
|
||||||
std::size_t headersEnd = dataBlock.find("\r\n\r\n"), headerPos = 0;
|
|
||||||
while (headerPos < headersEnd) {
|
|
||||||
std::size_t colonPos = dataBlock.find(":", headerPos),
|
|
||||||
lineEnd = dataBlock.find("\r\n", colonPos);
|
|
||||||
if (colonPos == std::string::npos || lineEnd == std::string::npos)
|
|
||||||
break;
|
|
||||||
fieldData.headers.insert(
|
|
||||||
{dataBlock.substr(headerPos, colonPos - headerPos),
|
|
||||||
dataBlock.substr(colonPos + 2,
|
|
||||||
lineEnd - colonPos - 2)}); // -/+ 2's are for \r\n
|
|
||||||
headerPos = lineEnd + 2; // Same as above
|
|
||||||
}
|
|
||||||
|
|
||||||
fieldData.data = detail_processFormData::getBodyData(dataBlock);
|
|
||||||
|
|
||||||
formDataMap.insert({fieldName, fieldData});
|
|
||||||
currentPos = nextBoundaryPos;
|
|
||||||
}
|
|
||||||
|
|
||||||
return formDataMap;
|
|
||||||
}
|
|
||||||
|
|
||||||
// ===================
|
|
||||||
// Inline Helpers
|
|
||||||
// ===================
|
|
||||||
std::string inline Helpers::detail_processFormData::getFieldName(
|
|
||||||
const std::string &dataBlock) {
|
|
||||||
size_t nameStart = dataBlock.find("name=") + 6; // Skip 'name="'
|
|
||||||
size_t nameEnd = dataBlock.find("\"", nameStart);
|
|
||||||
return dataBlock.substr(nameStart, nameEnd - nameStart);
|
|
||||||
}
|
|
||||||
|
|
||||||
std::string inline Helpers::detail_processFormData::getBodyData(
|
|
||||||
const std::string &dataBlock) {
|
|
||||||
size_t bodyStart = dataBlock.find("\r\n\r\n") + 4; // Skip "\r\n\r\n"
|
|
||||||
size_t bodyLength =
|
|
||||||
dataBlock.size() - bodyStart - 2; // Remove trailing "\r\n"
|
|
||||||
return dataBlock.substr(bodyStart, bodyLength);
|
|
||||||
}
|
|
31
src/Main.hpp
31
src/Main.hpp
@@ -10,16 +10,15 @@
|
|||||||
#include <asio/placeholders.hpp>
|
#include <asio/placeholders.hpp>
|
||||||
#include <asio/streambuf.hpp>
|
#include <asio/streambuf.hpp>
|
||||||
|
|
||||||
#include <functional>
|
|
||||||
#include <string>
|
#include <string>
|
||||||
#include <unordered_map>
|
#include <unordered_map>
|
||||||
|
|
||||||
#define IP "0.0.0.0"
|
#define IP "127.0.0.1"
|
||||||
#define PORT 8000
|
#define PORT 8000
|
||||||
using asocket = asio::ip::tcp::socket;
|
using asocket = asio::ip::tcp::socket;
|
||||||
using asocket_ptr = std::shared_ptr<asocket>;
|
using asocket_ptr = std::shared_ptr<asocket>;
|
||||||
|
|
||||||
// We handle HTTP requests with processHTTPHeader, writeData, and processRequest
|
// We handle HTTP requests with readData, writeData, and processRequest
|
||||||
class HTTPrequest : public std::enable_shared_from_this<HTTPrequest> {
|
class HTTPrequest : public std::enable_shared_from_this<HTTPrequest> {
|
||||||
public:
|
public:
|
||||||
typedef std::shared_ptr<HTTPrequest> HTTPrequest_ptr;
|
typedef std::shared_ptr<HTTPrequest> HTTPrequest_ptr;
|
||||||
@@ -28,25 +27,15 @@ public:
|
|||||||
static HTTPrequest_ptr create(asio::io_context &context);
|
static HTTPrequest_ptr create(asio::io_context &context);
|
||||||
|
|
||||||
void start();
|
void start();
|
||||||
void sendResponse(std::string status, std::string mime, std::string data);
|
|
||||||
|
|
||||||
// Request itself
|
|
||||||
std::string requestType, requestPath, responseText;
|
|
||||||
std::unordered_map<std::string, std::string> headers, args;
|
|
||||||
std::string bodyContent;
|
|
||||||
|
|
||||||
private:
|
private:
|
||||||
HTTPrequest(asio::io_context &context);
|
HTTPrequest(asio::io_context &context);
|
||||||
void processRequest();
|
|
||||||
void waitForClientClose();
|
|
||||||
|
|
||||||
// Breaking Header to in lines
|
|
||||||
void processHTTPHeader();
|
void processHTTPHeader();
|
||||||
void inline processArgs();
|
void processRequest(std::string requestType, std::string requestPath,
|
||||||
void inline processHeaderValues(std::basic_istream<char> &stream);
|
std::unordered_map<std::string, std::string> request,
|
||||||
void inline processBody();
|
std::unordered_map<std::string, std::string> args);
|
||||||
|
void writeData(std::string data);
|
||||||
|
|
||||||
// Networking
|
|
||||||
asio::ip::tcp::socket sock;
|
asio::ip::tcp::socket sock;
|
||||||
asio::streambuf buffer;
|
asio::streambuf buffer;
|
||||||
};
|
};
|
||||||
@@ -56,16 +45,8 @@ class Webserver : public std::enable_shared_from_this<Webserver> {
|
|||||||
public:
|
public:
|
||||||
Webserver(asio::io_context &context);
|
Webserver(asio::io_context &context);
|
||||||
|
|
||||||
// Responses
|
|
||||||
static std::unordered_map<
|
|
||||||
std::string,
|
|
||||||
std::unordered_map<std::string, std::function<void(HTTPrequest *self)>>>
|
|
||||||
responseMethods;
|
|
||||||
|
|
||||||
private:
|
private:
|
||||||
void begin();
|
void begin();
|
||||||
static void initResponses();
|
|
||||||
|
|
||||||
asio::io_context &io;
|
asio::io_context &io;
|
||||||
asio::ip::tcp::acceptor accept;
|
asio::ip::tcp::acceptor accept;
|
||||||
};
|
};
|
||||||
|
@@ -1,6 +1,5 @@
|
|||||||
#include "../Main.hpp"
|
#include "Main.hpp"
|
||||||
#include <iostream>
|
#include <iostream>
|
||||||
#include <ostream>
|
|
||||||
|
|
||||||
// Webserver is defined at main.hpp, you probably do not want to code here
|
// Webserver is defined at main.hpp, you probably do not want to code here
|
||||||
Webserver::Webserver(asio::io_context &context)
|
Webserver::Webserver(asio::io_context &context)
|
||||||
@@ -8,8 +7,6 @@ Webserver::Webserver(asio::io_context &context)
|
|||||||
accept(context,
|
accept(context,
|
||||||
asio::ip::tcp::endpoint(asio::ip::make_address(IP), PORT)) {
|
asio::ip::tcp::endpoint(asio::ip::make_address(IP), PORT)) {
|
||||||
std::cout << "Server is up!\n";
|
std::cout << "Server is up!\n";
|
||||||
initResponses();
|
|
||||||
std::cout << "Path responses are set up!" << std::endl;
|
|
||||||
begin();
|
begin();
|
||||||
}
|
}
|
||||||
|
|
@@ -1,15 +0,0 @@
|
|||||||
<!DOCTYPE html>
|
|
||||||
<html lang="en">
|
|
||||||
|
|
||||||
<head>
|
|
||||||
<meta charset="UTF-8">
|
|
||||||
<meta name="viewport" content="width=device-width, initial-scale=1">
|
|
||||||
<title></title>
|
|
||||||
</head>
|
|
||||||
|
|
||||||
<body>
|
|
||||||
<h1>404 NOT FOUND</h1>
|
|
||||||
<p>We could not find the requested page! Sorry ~_~ </p>
|
|
||||||
</body>
|
|
||||||
|
|
||||||
</html>
|
|
@@ -11,11 +11,7 @@
|
|||||||
<h1>Welcome</h1>
|
<h1>Welcome</h1>
|
||||||
<h1>POST test</h1>
|
<h1>POST test</h1>
|
||||||
<form action="/upload" method="POST" enctype="multipart/form-data">
|
<form action="/upload" method="POST" enctype="multipart/form-data">
|
||||||
<input type="text" name="filePassword">
|
<input type="file" name="uploaded_file">
|
||||||
<input type="text" name="name">
|
|
||||||
<input type="number" name="numb">
|
|
||||||
<input type="date" name="time">
|
|
||||||
<input type="file" name="uploadedFile">
|
|
||||||
<input type="submit" value="Upload">
|
<input type="submit" value="Upload">
|
||||||
</form>
|
</form>
|
||||||
</body>
|
</body>
|
||||||
|
Reference in New Issue
Block a user