Rework
This commit is contained in:
commit
a4e5e24292
4
.devcontainer/Dockerfile
Normal file
4
.devcontainer/Dockerfile
Normal file
@ -0,0 +1,4 @@
|
|||||||
|
ARG VARIANT="1"
|
||||||
|
FROM mcr.microsoft.com/devcontainers/rust:${VARIANT}
|
||||||
|
|
||||||
|
RUN apt update && apt install -y ffmpeg libopencv-dev clang libclang-dev
|
13
.devcontainer/devcontainer.json
Normal file
13
.devcontainer/devcontainer.json
Normal file
@ -0,0 +1,13 @@
|
|||||||
|
{
|
||||||
|
"name": "Rust",
|
||||||
|
"build": {
|
||||||
|
"context": "..",
|
||||||
|
"dockerfile": "Dockerfile",
|
||||||
|
"args": {
|
||||||
|
"VARIANT": "1",
|
||||||
|
"NODE_VERSION": "none"
|
||||||
|
}
|
||||||
|
},
|
||||||
|
"postCreateCommand": "cargo build",
|
||||||
|
"remoteUser": "vscode"
|
||||||
|
}
|
16
.gitignore
vendored
Normal file
16
.gitignore
vendored
Normal file
@ -0,0 +1,16 @@
|
|||||||
|
/target
|
||||||
|
/dump
|
||||||
|
/src/out
|
||||||
|
/output.avi
|
||||||
|
/setting_tests
|
||||||
|
/output.txt
|
||||||
|
/yt-dlp
|
||||||
|
/test.mp4
|
||||||
|
/src/demo
|
||||||
|
/src/tests/demo.zip
|
||||||
|
/.DS_Store
|
||||||
|
/src/.DS_Store
|
||||||
|
/test2.mp4
|
||||||
|
/output.zip
|
||||||
|
/output.png
|
||||||
|
/cargo_home/**
|
1657
Cargo.lock
generated
Normal file
1657
Cargo.lock
generated
Normal file
File diff suppressed because it is too large
Load Diff
15
Cargo.toml
Normal file
15
Cargo.toml
Normal file
@ -0,0 +1,15 @@
|
|||||||
|
[package]
|
||||||
|
name = "isg_4real"
|
||||||
|
version = "0.1.0"
|
||||||
|
edition = "2021"
|
||||||
|
|
||||||
|
# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
|
||||||
|
|
||||||
|
[dependencies]
|
||||||
|
anyhow = "1.0.68"
|
||||||
|
clap = {version = "4.1.6", features = ["derive"]}
|
||||||
|
inquire = "0.5.3"
|
||||||
|
opencv = "0.75.0"
|
||||||
|
tokio = {version = "1.24.2", features = ["full"]}
|
||||||
|
youtube_dl = { version = "0.8.0", features = ["downloader"] }
|
||||||
|
chrono = "0.4"
|
27
Dockerfile
Normal file
27
Dockerfile
Normal file
@ -0,0 +1,27 @@
|
|||||||
|
FROM ubuntu:22.04
|
||||||
|
|
||||||
|
# Non-interactive mode for apt-get
|
||||||
|
ARG DEBIAN_FRONTEND=noninteractive
|
||||||
|
|
||||||
|
# Install dependencies
|
||||||
|
RUN apt-get update
|
||||||
|
RUN apt-get install -y git
|
||||||
|
RUN apt-get install -y curl
|
||||||
|
RUN apt-get install -y libopencv-dev
|
||||||
|
RUN apt-get install -y ffmpeg
|
||||||
|
RUN apt-get install -y build-essential
|
||||||
|
RUN apt-get install -y libssl-dev
|
||||||
|
RUN apt-get install -y clang libclang-dev
|
||||||
|
|
||||||
|
# Install Rust
|
||||||
|
RUN curl https://sh.rustup.rs -sSf | sh -s -- -y
|
||||||
|
ENV PATH="/root/.cargo/bin:${PATH}"
|
||||||
|
|
||||||
|
# Set the working directory
|
||||||
|
WORKDIR /home/Infinite-Storage-Glitch
|
||||||
|
|
||||||
|
# Set cargo home to a folder in the working directory this will make rebuild
|
||||||
|
# faster as it allows the cargo cache to be saved between docker runs.
|
||||||
|
ENV CARGO_HOME=/home/Infinite-Storage-Glitch/cargo_home
|
||||||
|
|
||||||
|
CMD ["/bin/bash"]
|
674
LICENSE.md
Normal file
674
LICENSE.md
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>.
|
97
README.md
Normal file
97
README.md
Normal file
@ -0,0 +1,97 @@
|
|||||||
|
#### I was working on this instead of my finals, hope you appreciate it.
|
||||||
|
|
||||||
|
Treat this less like the next dropbox and more like a "party trick" or a set of techniques to learn to pass data through compression. I do not endorse high volume use of this tool. I will also refrain from approving more commits to make the tool more convenient to use (maybe archive). There are several bugs that limit the use like the poor use of RAM limiting the size of files to about 100mb and they will remain. If you wish to fix these, you are on your own.
|
||||||
|
|
||||||
|
# Infinite-Storage-Glitch
|
||||||
|
|
||||||
|
![ezgif com-gif-maker](https://user-images.githubusercontent.com/96934612/219563410-7728447d-5482-41ae-a3ff-cf8446e16ab7.gif)
|
||||||
|
|
||||||
|
AKA ISG (written entirely in Rust my beloved) lets you embed files into video and upload them to youtube as storage.
|
||||||
|
|
||||||
|
This has been quite heavily inspired by suckerpinch's [Harder Drive](https://www.youtube.com/watch?v=JcJSW7Rprio) video and [discord as a filesystem](https://github.com/pixelomer/discord-fs). Unfortunately no filesystem functionality as of right now.
|
||||||
|
|
||||||
|
# Now, you might be asking yourself:
|
||||||
|
|
||||||
|
<details>
|
||||||
|
<summary><b>But is this against YouTube TOS ?</b></summary>
|
||||||
|
<b>Answer is:</b> probably?
|
||||||
|
|
||||||
|
I don't speak legalese. Depending on the interpretation of "Autogenerated content that computers post without regard for quality or viewer experience" from [community guidelines](https://support.google.com/youtube/answer/2801973?hl=en#) this could be a violation. The TOS also mention circumventing the service which this tool probably does. Use at your own risk. I don't advise using this tool for anything serious/large. YouTube might understandably get mad, even though the videos might be private. Treat this less like the next dropbox and more like a "party trick".
|
||||||
|
</details>
|
||||||
|
|
||||||
|
# Installation
|
||||||
|
## The source way (building from source with manually installing dependencies)
|
||||||
|
|
||||||
|
=== *Please note: building from source takes **a lot of CPU and RAM** usage.* ===\
|
||||||
|
You need to have installed:
|
||||||
|
- [Rust](https://www.rust-lang.org/tools/install)
|
||||||
|
- [opencv](https://github.com/twistedfall/opencv-rust)
|
||||||
|
|
||||||
|
If having any issues also try installing:
|
||||||
|
- [ffmpeg](https://ffmpeg.org/)
|
||||||
|
- [clang](https://clang.llvm.org/)
|
||||||
|
- [qt](https://github.com/qt)
|
||||||
|
|
||||||
|
If you want to or already have went through the hassle of installing Rust, you can ```git clone``` this repository, then ```cargo build --release```.
|
||||||
|
Cd to `/target/release` directory and run the program `./isg_4real`.
|
||||||
|
|
||||||
|
## The easiest way (Docker)
|
||||||
|
|
||||||
|
Trying to make anything work on other people's computers is a nightmare so I'll use docker from now on
|
||||||
|
|
||||||
|
1. Install [Docker](https://docs.docker.com/get-docker/) if you haven't already.
|
||||||
|
2. Clone this repository
|
||||||
|
3. Change into the repository `cd Infinite-Storage-Glitch`
|
||||||
|
4. Run `docker build -t isg .` to build the docker image.
|
||||||
|
5. Run `docker run -it --rm -v ${PWD}:/home/Infinite-Storage-Glitch isg cargo build --release` to build the project.
|
||||||
|
|
||||||
|
That's it. You will find the executable in the `target/release` directory.
|
||||||
|
|
||||||
|
ℹ️ **Please Note:** The binary will be a linux executable, so you will need to run it in a linux environment.
|
||||||
|
If you do not have a linux environment, you can use [WSL](https://docs.microsoft.com/en-us/windows/wsl/install-win10)
|
||||||
|
or run it using the docker container called `isg` we just built **using a Linux shell or PowerShell**:
|
||||||
|
|
||||||
|
```bash
|
||||||
|
docker run -it --rm -v ${PWD}:/home/Infinite-Storage-Glitch isg ./target/release/isg_4real
|
||||||
|
```
|
||||||
|
|
||||||
|
**Note:** If you are using `cmd` on Windows, you will need to use `%cd%` instead of `${PWD}`.
|
||||||
|
|
||||||
|
How to use
|
||||||
|
-------------
|
||||||
|
1. Archive to zip all the files you will be uploading
|
||||||
|
2. Run the executable
|
||||||
|
3. Use the embed option on the archive (**THE VIDEO WILL BE SEVERAL TIMES LARGER THAN THE FILE**, 4x in case of optimal compression resistance preset)
|
||||||
|
4. Upload the video to your YouTube channel. You probably want to keep it up as unlisted
|
||||||
|
5. Use the download option to get the video back
|
||||||
|
6. Use the dislodge option to get your files back from the downloaded video
|
||||||
|
7. PROFIT
|
||||||
|
|
||||||
|
![2023-02-16_22-12](https://user-images.githubusercontent.com/96934612/219563769-c05370e9-3f40-406a-85b8-eca14a118be8.png)
|
||||||
|
|
||||||
|
|
||||||
|
# Demo
|
||||||
|
**Flashing lights warning !!!1!1** - [YouTube Link](https://www.youtube.com/watch?v=8I4fd_Sap-g)
|
||||||
|
|
||||||
|
Try to use the program on this video and find the files hidden inside.
|
||||||
|
|
||||||
|
***No it's not just a rick roll.***
|
||||||
|
|
||||||
|
Explanation 4 nerds
|
||||||
|
-------------
|
||||||
|
The principle behind this is pretty simple. All files are made of bytes and bytes can be interpreted as numbers ranging from 0-255. This number can be represented with pixels using one of two modes: RGB or binary.
|
||||||
|
|
||||||
|
**RGB**:
|
||||||
|
The cooler mode. Every byte perfectly fits inside one of the colors of an rgb pixel. One rgb pixel can contain 3 bytes at a time. You just keep adding pixels like this until you run out of data. It is leagues more efficient and quick than binary.
|
||||||
|
|
||||||
|
**Binary**:
|
||||||
|
Born from YouTube compression being absolutely brutal. RGB mode is very sensitive to compression as a change in even one point of one of the colors of one of the pixels dooms the file to corruption. Black and white pixels are a lot harder to mess up. Every pixel is either bright representing a 1 or dark representing a 0. We string these bits together to get bytes and continue until we run out of data.
|
||||||
|
|
||||||
|
Both of these modes can be corrupted by compression, so we need to increase the size of the pixels to make it less compressable. 2x2 blocks of pixels seem to be good enough in binary mode.
|
||||||
|
|
||||||
|
To make it easier on the user, we also include all the relevant settings used to create the video on the first frame of the video. This allows the program to know what mode the video is in and what size to use in order to avoid making the user remember.
|
||||||
|
|
||||||
|
# Final comments
|
||||||
|
I appreciate any and all roasting of the code so I can improve.
|
||||||
|
|
||||||
|
Do what you want with the code, but credit would be much appreciated and if you have any trouble with ISG, please contact me over discord.
|
103
src/args.rs
Normal file
103
src/args.rs
Normal file
@ -0,0 +1,103 @@
|
|||||||
|
use clap::{Args, Parser, Subcommand, ValueEnum};
|
||||||
|
|
||||||
|
/// This encodes which, if any, subcommand was picked.
|
||||||
|
/// If none were picked, default to UI selects.
|
||||||
|
#[derive(Parser)]
|
||||||
|
pub struct Arguments {
|
||||||
|
#[command(subcommand)]
|
||||||
|
pub command: Option<Commands>,
|
||||||
|
}
|
||||||
|
|
||||||
|
/// This encodes the specific subcommand the user requested: embed, download or dislodge.
|
||||||
|
#[derive(Subcommand)]
|
||||||
|
pub enum Commands {
|
||||||
|
Embed(EmbedParams),
|
||||||
|
Download(DownloadParams),
|
||||||
|
Dislodge(DislodgeParams),
|
||||||
|
}
|
||||||
|
|
||||||
|
/// This encodes the specific params for embedding.
|
||||||
|
/// All values are optional, and will be substituted in using UI if missing.
|
||||||
|
#[derive(Args, Default, Debug)]
|
||||||
|
pub struct EmbedParams {
|
||||||
|
#[arg(short, long)]
|
||||||
|
/// Path to the file with the data to encode
|
||||||
|
pub in_path: Option<String>,
|
||||||
|
|
||||||
|
/// Preset to use when encoding data.
|
||||||
|
/// More specific encoding options override preset options.
|
||||||
|
#[arg(short, long)]
|
||||||
|
pub preset: Option<EmbedPreset>,
|
||||||
|
|
||||||
|
/// Etching mode
|
||||||
|
#[arg(long)]
|
||||||
|
pub mode: Option<EmbedOutputMode>,
|
||||||
|
|
||||||
|
/// Block size, in pixels per side
|
||||||
|
#[arg(long)]
|
||||||
|
pub block_size: Option<i32>,
|
||||||
|
|
||||||
|
/// Threads to use when encoding
|
||||||
|
#[arg(long)]
|
||||||
|
pub threads: Option<usize>,
|
||||||
|
|
||||||
|
/// Output video FPS
|
||||||
|
#[arg(long)]
|
||||||
|
pub fps: Option<i32>,
|
||||||
|
|
||||||
|
/// Output video resolution.
|
||||||
|
/// Must be one of "144", "240", "360", "480" or "720",
|
||||||
|
/// and if the value provided is none of these,
|
||||||
|
/// defaults to "360".
|
||||||
|
#[arg(long)]
|
||||||
|
pub resolution: Option<String>, // TODO: fix this so it's checked at parse time
|
||||||
|
}
|
||||||
|
|
||||||
|
#[derive(Debug, Clone, ValueEnum)]
|
||||||
|
pub enum EmbedPreset {
|
||||||
|
/// Optimal compression resistance
|
||||||
|
Optimal,
|
||||||
|
/// Paranoid compression resistance
|
||||||
|
Paranoid,
|
||||||
|
/// Maximum efficiency
|
||||||
|
MaxEfficiency,
|
||||||
|
}
|
||||||
|
|
||||||
|
#[derive(Debug, Clone, ValueEnum)]
|
||||||
|
pub enum EmbedOutputMode {
|
||||||
|
/// Uses RGB values and breaks under compression
|
||||||
|
Colored,
|
||||||
|
/// Uses black and white pixels and resists compression
|
||||||
|
Binary,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl From<EmbedOutputMode> for crate::settings::OutputMode {
|
||||||
|
fn from(value: EmbedOutputMode) -> Self {
|
||||||
|
match value {
|
||||||
|
EmbedOutputMode::Colored => Self::Color,
|
||||||
|
EmbedOutputMode::Binary => Self::Binary,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/// This encodes the specific params for downloading.
|
||||||
|
/// All values are optional, and will be substituted in using UI if missing.
|
||||||
|
#[derive(Args, Default)]
|
||||||
|
pub struct DownloadParams {
|
||||||
|
/// Video URL
|
||||||
|
#[arg(short, long)]
|
||||||
|
pub url: Option<String>,
|
||||||
|
}
|
||||||
|
|
||||||
|
/// This encodes the specific params for dislodging.
|
||||||
|
/// All values are optional, and will be substituted in using UI if missing.
|
||||||
|
#[derive(Args, Default)]
|
||||||
|
pub struct DislodgeParams {
|
||||||
|
/// Path to input video
|
||||||
|
#[arg(short, long)]
|
||||||
|
pub in_path: Option<String>,
|
||||||
|
|
||||||
|
/// Path to file output (including extension)
|
||||||
|
#[arg(short, long)]
|
||||||
|
pub out_path: Option<String>,
|
||||||
|
}
|
50
src/embedsource.rs
Normal file
50
src/embedsource.rs
Normal file
@ -0,0 +1,50 @@
|
|||||||
|
use opencv::core::prelude::*;
|
||||||
|
use opencv::core::{Mat, Size, CV_8UC3};
|
||||||
|
|
||||||
|
pub struct EmbedSource {
|
||||||
|
pub image: Mat,
|
||||||
|
pub size: i32,
|
||||||
|
pub frame_size: Size,
|
||||||
|
pub actual_size: Size,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl EmbedSource {
|
||||||
|
pub fn new(size: i32, width: i32, height: i32) -> EmbedSource {
|
||||||
|
let frame_size = Size::new(width, height);
|
||||||
|
let actual_width = width - (width % size);
|
||||||
|
let actual_height = height - (height % size);
|
||||||
|
let actual_size = Size::new(actual_width, actual_height);
|
||||||
|
|
||||||
|
unsafe {
|
||||||
|
let image = Mat::new_rows_cols(frame_size.height, frame_size.width, CV_8UC3)
|
||||||
|
.expect("Failed to create new Mat");
|
||||||
|
|
||||||
|
EmbedSource {
|
||||||
|
image,
|
||||||
|
size,
|
||||||
|
frame_size,
|
||||||
|
actual_size,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
pub fn from(image: Mat, size: i32, instruction: bool) -> Result<EmbedSource, String> {
|
||||||
|
let width = image.cols();
|
||||||
|
let height = image.rows();
|
||||||
|
let frame_size = Size::new(width, height);
|
||||||
|
|
||||||
|
//Some malevolent spirit breaks data when height is not divisible
|
||||||
|
if height % size != 0 && !(instruction) {
|
||||||
|
return Err("Image size is not a multiple of the embedding size".to_string());
|
||||||
|
}
|
||||||
|
|
||||||
|
let actual_size = Size::new(width - (width % size), height - (height % size));
|
||||||
|
|
||||||
|
Ok(EmbedSource {
|
||||||
|
image,
|
||||||
|
size,
|
||||||
|
frame_size,
|
||||||
|
actual_size,
|
||||||
|
})
|
||||||
|
}
|
||||||
|
}
|
678
src/etcher.rs
Normal file
678
src/etcher.rs
Normal file
@ -0,0 +1,678 @@
|
|||||||
|
use std::{fs, thread, vec};
|
||||||
|
|
||||||
|
use anyhow::{anyhow, Error}; //anyhow::Error::msg("My err");
|
||||||
|
|
||||||
|
use opencv::core::Mat;
|
||||||
|
use opencv::prelude::*;
|
||||||
|
use opencv::videoio::{VideoCapture, VideoWriter, CAP_ANY};
|
||||||
|
|
||||||
|
use crate::embedsource::EmbedSource;
|
||||||
|
use crate::settings::{Data, OutputMode, Settings};
|
||||||
|
use crate::timer::Timer;
|
||||||
|
|
||||||
|
//Get and write bytes from and to files. Start and end of app
|
||||||
|
//sounds cooler than og name (encode)
|
||||||
|
pub fn rip_bytes(path: &str) -> anyhow::Result<Vec<u8>> {
|
||||||
|
let byte_data = fs::read(path)?;
|
||||||
|
|
||||||
|
if byte_data.is_empty() {
|
||||||
|
return Err(anyhow!(
|
||||||
|
"Empty files cannot be embedded! File names are not retained, so it's pointless anyway"
|
||||||
|
));
|
||||||
|
}
|
||||||
|
println!("Bytes ripped succesfully");
|
||||||
|
println!("Byte length: {}", byte_data.len());
|
||||||
|
return Ok(byte_data);
|
||||||
|
}
|
||||||
|
|
||||||
|
pub fn rip_binary(byte_data: Vec<u8>) -> anyhow::Result<Vec<bool>> {
|
||||||
|
let mut binary_data: Vec<bool> = Vec::new();
|
||||||
|
|
||||||
|
for byte in byte_data {
|
||||||
|
//Returns binary but doesn't include all 8 bits if a number fits into less than 8.
|
||||||
|
let mut bits = format!("{:b}", byte);
|
||||||
|
let missing_0 = 8 - bits.len();
|
||||||
|
|
||||||
|
//Adding the missing 0's, could be faster
|
||||||
|
for _ in 0..missing_0 {
|
||||||
|
bits.insert(0, '0');
|
||||||
|
}
|
||||||
|
|
||||||
|
for bit in bits.chars() {
|
||||||
|
if bit == '1' {
|
||||||
|
binary_data.push(true);
|
||||||
|
} else {
|
||||||
|
binary_data.push(false);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
println!("Binary ripped successfully");
|
||||||
|
// println!("Binary length: {}", binary_data.len());
|
||||||
|
return Ok(binary_data);
|
||||||
|
}
|
||||||
|
|
||||||
|
pub fn rip_binary_u32(bytes: Vec<u32>) -> anyhow::Result<Vec<bool>> {
|
||||||
|
let mut binary_data: Vec<bool> = Vec::new();
|
||||||
|
|
||||||
|
for byte in bytes {
|
||||||
|
let mut bits = format!("{:b}", byte);
|
||||||
|
let missing_0 = 32 - bits.len();
|
||||||
|
|
||||||
|
//Adding the missing 0's, could be faster
|
||||||
|
for _ in 0..missing_0 {
|
||||||
|
bits.insert(0, '0');
|
||||||
|
}
|
||||||
|
|
||||||
|
for bit in bits.chars() {
|
||||||
|
if bit == '1' {
|
||||||
|
binary_data.push(true);
|
||||||
|
} else {
|
||||||
|
binary_data.push(false);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return Ok(binary_data);
|
||||||
|
}
|
||||||
|
|
||||||
|
fn translate_u8(binary_data: Vec<bool>) -> anyhow::Result<Vec<u8>> {
|
||||||
|
let mut buffer: Vec<bool> = Vec::new();
|
||||||
|
let mut byte_data: Vec<u8> = Vec::new();
|
||||||
|
|
||||||
|
for bit in binary_data {
|
||||||
|
buffer.push(bit);
|
||||||
|
|
||||||
|
if buffer.len() == 8 {
|
||||||
|
//idk how this works but it does
|
||||||
|
let byte = buffer.iter().fold(0u8, |v, b| (v << 1) + (*b as u8));
|
||||||
|
|
||||||
|
byte_data.push(byte);
|
||||||
|
buffer.clear();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return Ok(byte_data);
|
||||||
|
}
|
||||||
|
|
||||||
|
fn translate_u32(binary_data: Vec<bool>) -> anyhow::Result<Vec<u32>> {
|
||||||
|
let mut buffer: Vec<bool> = Vec::new();
|
||||||
|
let mut byte_data: Vec<u32> = Vec::new();
|
||||||
|
|
||||||
|
for bit in binary_data {
|
||||||
|
buffer.push(bit);
|
||||||
|
|
||||||
|
if buffer.len() == 32 {
|
||||||
|
//idk how this works but it does
|
||||||
|
let u32_byte = buffer.iter().fold(0u32, |v, b| (v << 1) + (*b as u32));
|
||||||
|
byte_data.push(u32_byte);
|
||||||
|
buffer.clear();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return Ok(byte_data);
|
||||||
|
}
|
||||||
|
|
||||||
|
pub fn write_bytes(path: &str, data: Vec<u8>) -> anyhow::Result<()> {
|
||||||
|
fs::write(path, data)?;
|
||||||
|
println!("File written successfully");
|
||||||
|
return Ok(());
|
||||||
|
}
|
||||||
|
|
||||||
|
//Returns average value of the pixel given size and location
|
||||||
|
fn get_pixel(frame: &EmbedSource, x: i32, y: i32) -> Option<Vec<u8>> {
|
||||||
|
let mut r_list: Vec<u8> = Vec::new();
|
||||||
|
let mut g_list: Vec<u8> = Vec::new();
|
||||||
|
let mut b_list: Vec<u8> = Vec::new();
|
||||||
|
|
||||||
|
for i in 0..frame.size {
|
||||||
|
for j in 0..frame.size {
|
||||||
|
let bgr = frame
|
||||||
|
.image
|
||||||
|
.at_2d::<opencv::core::Vec3b>(y + i, x + j)
|
||||||
|
.unwrap();
|
||||||
|
//could reduce size of integers ?
|
||||||
|
r_list.push(bgr[2]);
|
||||||
|
g_list.push(bgr[1]);
|
||||||
|
b_list.push(bgr[0]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
//A hacked on solution, do better
|
||||||
|
let r_sum: usize = r_list.iter().map(|&x| x as usize).sum();
|
||||||
|
let r_average = r_sum / r_list.len();
|
||||||
|
let g_sum: usize = g_list.iter().map(|&x| x as usize).sum();
|
||||||
|
let g_average = g_sum / g_list.len();
|
||||||
|
let b_sum: usize = b_list.iter().map(|&x| x as usize).sum();
|
||||||
|
let b_average = b_sum / b_list.len();
|
||||||
|
|
||||||
|
//Potentially unnecessary conversion
|
||||||
|
let rgb_average = vec![r_average as u8, g_average as u8, b_average as u8];
|
||||||
|
// dbg!(&rgb_average);
|
||||||
|
|
||||||
|
return Some(rgb_average);
|
||||||
|
}
|
||||||
|
|
||||||
|
//Draws the pixels, exists so you can draw bigger blocks
|
||||||
|
fn etch_pixel(frame: &mut EmbedSource, rgb: Vec<u8>, x: i32, y: i32) -> anyhow::Result<()> {
|
||||||
|
for i in 0..frame.size {
|
||||||
|
for j in 0..frame.size {
|
||||||
|
// dbg!(x, y);
|
||||||
|
let bgr = frame.image.at_2d_mut::<opencv::core::Vec3b>(y + i, x + j)?;
|
||||||
|
//Opencv devs are reptilians who believe in bgr
|
||||||
|
bgr[2] = rgb[0];
|
||||||
|
bgr[1] = rgb[1];
|
||||||
|
bgr[0] = rgb[2];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return Ok(());
|
||||||
|
}
|
||||||
|
|
||||||
|
fn etch_bw(
|
||||||
|
source: &mut EmbedSource,
|
||||||
|
data: &Vec<bool>,
|
||||||
|
global_index: &mut usize,
|
||||||
|
) -> anyhow::Result<()> {
|
||||||
|
let _timer = Timer::new("Etching frame");
|
||||||
|
|
||||||
|
let width = source.actual_size.width;
|
||||||
|
let height = source.actual_size.height;
|
||||||
|
let size = source.size as usize;
|
||||||
|
|
||||||
|
for y in (0..height).step_by(size) {
|
||||||
|
for x in (0..width).step_by(size) {
|
||||||
|
let local_index = global_index.clone();
|
||||||
|
|
||||||
|
let brightness = if data[local_index] == true {
|
||||||
|
255 // 1
|
||||||
|
} else {
|
||||||
|
0 // 0
|
||||||
|
};
|
||||||
|
let rgb = vec![brightness, brightness, brightness];
|
||||||
|
|
||||||
|
//Actually embeds the data
|
||||||
|
etch_pixel(source, rgb, x, y).unwrap();
|
||||||
|
|
||||||
|
//Increment index so we move along the data
|
||||||
|
*global_index += 1;
|
||||||
|
if *global_index >= data.len() {
|
||||||
|
return Err(Error::msg("Index beyond data"));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return Ok(());
|
||||||
|
}
|
||||||
|
|
||||||
|
fn etch_color(
|
||||||
|
source: &mut EmbedSource,
|
||||||
|
data: &Vec<u8>,
|
||||||
|
global_index: &mut usize,
|
||||||
|
) -> anyhow::Result<()> {
|
||||||
|
let _timer = Timer::new("Etching frame");
|
||||||
|
|
||||||
|
let width = source.actual_size.width;
|
||||||
|
let height = source.actual_size.height;
|
||||||
|
let size = source.size as usize;
|
||||||
|
|
||||||
|
for y in (0..height).step_by(size) {
|
||||||
|
for x in (0..width).step_by(size) {
|
||||||
|
let local_index = global_index.clone();
|
||||||
|
|
||||||
|
let rgb = vec![
|
||||||
|
data[local_index], //Red
|
||||||
|
data[local_index + 1], //Green
|
||||||
|
data[local_index + 2], //Blue
|
||||||
|
];
|
||||||
|
|
||||||
|
etch_pixel(source, rgb, x, y).unwrap();
|
||||||
|
|
||||||
|
//Increment index so we move along the data
|
||||||
|
*global_index += 3;
|
||||||
|
if *global_index + 2 >= data.len() {
|
||||||
|
return Err(Error::msg("Index beyond data"));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return Ok(());
|
||||||
|
}
|
||||||
|
|
||||||
|
fn read_bw(
|
||||||
|
source: &EmbedSource,
|
||||||
|
current_frame: i32,
|
||||||
|
final_frame: i32,
|
||||||
|
final_bit: i32,
|
||||||
|
) -> anyhow::Result<Vec<bool>> {
|
||||||
|
// let _timer = Timer::new("Dislodging frame");
|
||||||
|
|
||||||
|
let width = source.actual_size.width;
|
||||||
|
let height = source.actual_size.height;
|
||||||
|
let size = source.size as usize;
|
||||||
|
|
||||||
|
let mut binary_data: Vec<bool> = Vec::new();
|
||||||
|
for y in (0..height).step_by(size) {
|
||||||
|
for x in (0..width).step_by(size) {
|
||||||
|
let rgb = get_pixel(&source, x, y);
|
||||||
|
if rgb == None {
|
||||||
|
continue;
|
||||||
|
} else {
|
||||||
|
let rgb = rgb.unwrap();
|
||||||
|
if rgb[0] >= 127 {
|
||||||
|
binary_data.push(true);
|
||||||
|
} else {
|
||||||
|
binary_data.push(false);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
//Cut off nasty bits at the end
|
||||||
|
if current_frame == final_frame {
|
||||||
|
let slice = binary_data[0..final_bit as usize].to_vec();
|
||||||
|
return Ok(slice);
|
||||||
|
}
|
||||||
|
|
||||||
|
// dbg!(binary_data.len());
|
||||||
|
return Ok(binary_data);
|
||||||
|
}
|
||||||
|
|
||||||
|
fn read_color(
|
||||||
|
source: &EmbedSource,
|
||||||
|
current_frame: i32,
|
||||||
|
final_frame: i32,
|
||||||
|
final_byte: i32,
|
||||||
|
) -> anyhow::Result<Vec<u8>> {
|
||||||
|
// let _timer = Timer::new("Dislodging frame");
|
||||||
|
|
||||||
|
let width = source.actual_size.width;
|
||||||
|
let height = source.actual_size.height;
|
||||||
|
let size = source.size as usize;
|
||||||
|
|
||||||
|
let mut byte_data: Vec<u8> = Vec::new();
|
||||||
|
for y in (0..height).step_by(size) {
|
||||||
|
for x in (0..width).step_by(size) {
|
||||||
|
let rgb = get_pixel(&source, x, y);
|
||||||
|
if rgb == None {
|
||||||
|
continue;
|
||||||
|
} else {
|
||||||
|
let rgb = rgb.unwrap();
|
||||||
|
byte_data.push(rgb[0]);
|
||||||
|
byte_data.push(rgb[1]);
|
||||||
|
byte_data.push(rgb[2]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
//Cut off nasty bits at the end
|
||||||
|
if current_frame == final_frame {
|
||||||
|
let slice = byte_data[0..final_byte as usize].to_vec();
|
||||||
|
return Ok(slice);
|
||||||
|
}
|
||||||
|
|
||||||
|
return Ok(byte_data);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
Instructions:
|
||||||
|
Etched on first frame, always be wrtten in binary despite output mode
|
||||||
|
Output mode is the first byte
|
||||||
|
Size is constant 5
|
||||||
|
11111111 = Color (255), 00000000 = Binary(0),
|
||||||
|
Second byte will be the size of the pixels
|
||||||
|
FPS doesn't matter, but can add it anyways
|
||||||
|
Potentially add ending pointer so it doesn't make useless bytes
|
||||||
|
^^Currently implemented(?), unused
|
||||||
|
*/
|
||||||
|
|
||||||
|
fn etch_instructions(settings: &Settings, data: &Data) -> anyhow::Result<EmbedSource> {
|
||||||
|
let instruction_size = 5;
|
||||||
|
|
||||||
|
let mut u32_instructions: Vec<u32> = Vec::new();
|
||||||
|
|
||||||
|
//calculating at what frame and pixel the file ends
|
||||||
|
let frame_size = (settings.height * settings.width) as usize;
|
||||||
|
|
||||||
|
//Adds the output mode to instructions
|
||||||
|
//Instead of putting entire size of file, add at which frame and pixel file ends
|
||||||
|
//Saves space on instruction frame
|
||||||
|
match data.out_mode {
|
||||||
|
OutputMode::Color => {
|
||||||
|
u32_instructions.push(u32::MAX);
|
||||||
|
|
||||||
|
let frame_data_size = frame_size / settings.size.pow(2) as usize;
|
||||||
|
let final_byte = data.bytes.len() % frame_data_size;
|
||||||
|
let mut final_frame = data.bytes.len() / frame_data_size;
|
||||||
|
|
||||||
|
//In case of edge case where frame is right on the money
|
||||||
|
if data.bytes.len() % frame_size != 0 {
|
||||||
|
final_frame += 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
dbg!(final_frame);
|
||||||
|
u32_instructions.push(final_frame as u32);
|
||||||
|
u32_instructions.push(final_byte as u32);
|
||||||
|
}
|
||||||
|
OutputMode::Binary => {
|
||||||
|
u32_instructions.push(u32::MIN);
|
||||||
|
|
||||||
|
let frame_data_size = frame_size / settings.size.pow(2) as usize;
|
||||||
|
let final_byte = data.binary.len() % frame_data_size;
|
||||||
|
let mut final_frame = data.binary.len() / frame_data_size;
|
||||||
|
|
||||||
|
//In case of edge case where frame is right on the money
|
||||||
|
if data.binary.len() % frame_size != 0 {
|
||||||
|
final_frame += 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
dbg!(final_frame);
|
||||||
|
u32_instructions.push(final_frame as u32);
|
||||||
|
u32_instructions.push(final_byte as u32);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
u32_instructions.push(settings.size as u32);
|
||||||
|
u32_instructions.push(u32::MAX); //For some reason size not readable without this
|
||||||
|
|
||||||
|
let instruction_data = rip_binary_u32(u32_instructions)?;
|
||||||
|
|
||||||
|
let mut source = EmbedSource::new(instruction_size, settings.width, settings.height);
|
||||||
|
let mut index = 0;
|
||||||
|
match etch_bw(&mut source, &instruction_data, &mut index) {
|
||||||
|
Ok(_) => {}
|
||||||
|
Err(_) => {
|
||||||
|
println!("Instructions written")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// highgui::named_window("window", WINDOW_FULLSCREEN)?;
|
||||||
|
// highgui::imshow("window", &source.image)?;
|
||||||
|
// highgui::wait_key(10000000)?;
|
||||||
|
|
||||||
|
// imwrite("src/out/test1.png", &source.image, &Vector::new())?;
|
||||||
|
|
||||||
|
return Ok(source);
|
||||||
|
}
|
||||||
|
|
||||||
|
fn read_instructions(
|
||||||
|
source: &EmbedSource,
|
||||||
|
threads: usize,
|
||||||
|
) -> anyhow::Result<(OutputMode, i32, i32, Settings)> {
|
||||||
|
//UGLY
|
||||||
|
let binary_data = read_bw(source, 0, 1, 0)?;
|
||||||
|
let u32_data = translate_u32(binary_data)?;
|
||||||
|
// dbg!(&u32_data);
|
||||||
|
|
||||||
|
let out_mode = u32_data[0];
|
||||||
|
|
||||||
|
let out_mode = match out_mode {
|
||||||
|
u32::MAX => OutputMode::Color,
|
||||||
|
_ => OutputMode::Binary,
|
||||||
|
};
|
||||||
|
|
||||||
|
let final_frame = u32_data[1] as i32;
|
||||||
|
let final_byte = u32_data[2] as i32;
|
||||||
|
let size = u32_data[3] as i32;
|
||||||
|
|
||||||
|
let height = source.frame_size.height;
|
||||||
|
let width = source.frame_size.width;
|
||||||
|
|
||||||
|
let settings = Settings::new(size, threads, 1337, width, height);
|
||||||
|
|
||||||
|
return Ok((out_mode, final_frame, final_byte, settings));
|
||||||
|
}
|
||||||
|
|
||||||
|
pub fn etch(path: &str, data: Data, settings: Settings) -> anyhow::Result<()> {
|
||||||
|
let _timer = Timer::new("Etching video");
|
||||||
|
|
||||||
|
let mut spool = Vec::new();
|
||||||
|
match data.out_mode {
|
||||||
|
OutputMode::Color => {
|
||||||
|
let length = data.bytes.len();
|
||||||
|
|
||||||
|
//UGLY
|
||||||
|
//Required so that data is continuous between each thread
|
||||||
|
let frame_size = (settings.width * settings.height) as usize;
|
||||||
|
let frame_data_size = frame_size / settings.size.pow(2) as usize * 3;
|
||||||
|
let frame_length = length / frame_data_size;
|
||||||
|
let chunk_frame_size = (frame_length / settings.threads) + 1;
|
||||||
|
let chunk_data_size = chunk_frame_size * frame_data_size;
|
||||||
|
|
||||||
|
//UGLY DUPING
|
||||||
|
let chunks = data.bytes.chunks(chunk_data_size);
|
||||||
|
for chunk in chunks {
|
||||||
|
//source of perf loss ?
|
||||||
|
let chunk_copy = chunk.to_vec();
|
||||||
|
|
||||||
|
let thread = thread::spawn(move || {
|
||||||
|
let mut frames = Vec::new();
|
||||||
|
let mut index: usize = 0;
|
||||||
|
|
||||||
|
loop {
|
||||||
|
let mut source =
|
||||||
|
EmbedSource::new(settings.size, settings.width, settings.height);
|
||||||
|
match etch_color(&mut source, &chunk_copy, &mut index) {
|
||||||
|
Ok(_) => frames.push(source),
|
||||||
|
Err(_v) => {
|
||||||
|
frames.push(source);
|
||||||
|
println!("Embedding thread complete!");
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return frames;
|
||||||
|
});
|
||||||
|
|
||||||
|
spool.push(thread);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
OutputMode::Binary => {
|
||||||
|
let length = data.binary.len();
|
||||||
|
//UGLY
|
||||||
|
//Required so that data is continuous between each thread
|
||||||
|
let frame_size = (settings.width * settings.height) as usize;
|
||||||
|
let frame_data_size = frame_size / settings.size.pow(2) as usize;
|
||||||
|
let frame_length = length / frame_data_size;
|
||||||
|
let chunk_frame_size = (frame_length / settings.threads) + 1;
|
||||||
|
let chunk_data_size = chunk_frame_size * frame_data_size;
|
||||||
|
|
||||||
|
//UGLY DUPING
|
||||||
|
let chunks = data.binary.chunks(chunk_data_size);
|
||||||
|
for chunk in chunks {
|
||||||
|
//source of perf loss ?
|
||||||
|
let chunk_copy = chunk.to_vec();
|
||||||
|
|
||||||
|
let thread = thread::spawn(move || {
|
||||||
|
let mut frames = Vec::new();
|
||||||
|
let mut index: usize = 0;
|
||||||
|
|
||||||
|
loop {
|
||||||
|
let mut source =
|
||||||
|
EmbedSource::new(settings.size, settings.width, settings.height);
|
||||||
|
match etch_bw(&mut source, &chunk_copy, &mut index) {
|
||||||
|
Ok(_) => frames.push(source),
|
||||||
|
Err(_v) => {
|
||||||
|
frames.push(source);
|
||||||
|
println!("Embedding thread complete!");
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return frames;
|
||||||
|
});
|
||||||
|
|
||||||
|
spool.push(thread);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
let mut complete_frames = Vec::new();
|
||||||
|
|
||||||
|
let instructional_frame = etch_instructions(&settings, &data)?;
|
||||||
|
complete_frames.push(instructional_frame);
|
||||||
|
|
||||||
|
for thread in spool {
|
||||||
|
let frame_chunk = thread.join().unwrap();
|
||||||
|
complete_frames.extend(frame_chunk);
|
||||||
|
}
|
||||||
|
|
||||||
|
//Mess around with lossless codecs, png seems fine
|
||||||
|
//Fourcc is a code for video codecs, trying to use a lossless one
|
||||||
|
let fourcc = VideoWriter::fourcc('p', 'n', 'g', ' ')?;
|
||||||
|
// let fourcc = VideoWriter::fourcc('j', 'p', 'e', 'g')?;
|
||||||
|
|
||||||
|
//Check if frame_size is flipped
|
||||||
|
let frame_size = complete_frames[1].frame_size;
|
||||||
|
let video = VideoWriter::new(path, fourcc, settings.fps, frame_size, true);
|
||||||
|
|
||||||
|
//Use different codec if png failed
|
||||||
|
let mut video = match video {
|
||||||
|
Ok(v) => v,
|
||||||
|
Err(_) => {
|
||||||
|
let fourcc = VideoWriter::fourcc('a', 'v', 'c', '1')?;
|
||||||
|
VideoWriter::new(path, fourcc, settings.fps, frame_size, true)
|
||||||
|
.expect("Both png and avc1 codecs failed, please raise an issue on github")
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
//Putting them in vector might be slower
|
||||||
|
for frame in complete_frames {
|
||||||
|
let image = frame.image;
|
||||||
|
video.write(&image)?;
|
||||||
|
}
|
||||||
|
video.release()?;
|
||||||
|
|
||||||
|
println!("Video embedded successfully at {}", path);
|
||||||
|
|
||||||
|
return Ok(());
|
||||||
|
}
|
||||||
|
|
||||||
|
pub fn read(path: &str, threads: usize) -> anyhow::Result<Vec<u8>> {
|
||||||
|
let _timer = Timer::new("Dislodging frame");
|
||||||
|
let instruction_size = 5;
|
||||||
|
|
||||||
|
let mut video = VideoCapture::from_file(&path, CAP_ANY).expect("Could not open video path");
|
||||||
|
let mut frame = Mat::default();
|
||||||
|
|
||||||
|
//Could probably avoid cloning
|
||||||
|
video.read(&mut frame)?;
|
||||||
|
let instruction_source =
|
||||||
|
EmbedSource::from(frame.clone(), instruction_size, true).expect("Couldn't create instructions");
|
||||||
|
let (out_mode, final_frame, final_byte, settings) =
|
||||||
|
read_instructions(&instruction_source, threads)?;
|
||||||
|
|
||||||
|
let mut byte_data = Vec::new();
|
||||||
|
let mut current_frame = 1;
|
||||||
|
loop {
|
||||||
|
// let _timer = Timer::new("Reading frame (clone included)");
|
||||||
|
video.read(&mut frame)?;
|
||||||
|
|
||||||
|
//If it reads an empty image, the video stopped
|
||||||
|
if frame.cols() == 0 {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
if current_frame % 20 == 0 {
|
||||||
|
println!("On frame: {}", current_frame);
|
||||||
|
}
|
||||||
|
|
||||||
|
let source = EmbedSource::from(frame.clone(), settings.size, false).expect("Reading frame failed");
|
||||||
|
|
||||||
|
let frame_data = match out_mode {
|
||||||
|
OutputMode::Color => read_color(&source, current_frame, 99999999, final_byte).unwrap(),
|
||||||
|
OutputMode::Binary => {
|
||||||
|
let binary_data = read_bw(&source, current_frame, final_frame, final_byte).unwrap();
|
||||||
|
translate_u8(binary_data).unwrap()
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
current_frame += 1;
|
||||||
|
|
||||||
|
byte_data.extend(frame_data);
|
||||||
|
}
|
||||||
|
|
||||||
|
println!("Video read successfully");
|
||||||
|
return Ok(byte_data);
|
||||||
|
}
|
||||||
|
|
||||||
|
//Uses literally all the RAM
|
||||||
|
// pub fn read(path: &str, threads: usize) -> anyhow::Result<Vec<u8>> {
|
||||||
|
// let _timer = Timer::new("Dislodging frame");
|
||||||
|
// let instruction_size = 5;
|
||||||
|
|
||||||
|
// let mut video = VideoCapture::from_file(&path, CAP_ANY)
|
||||||
|
// .expect("Could not open video path");
|
||||||
|
// let mut frame = Mat::default();
|
||||||
|
|
||||||
|
// //Could probably avoid cloning
|
||||||
|
// video.read(&mut frame)?;
|
||||||
|
// let instruction_source = EmbedSource::from(frame.clone(), instruction_size);
|
||||||
|
// let (out_mode, final_frame, final_byte, settings) = read_instructions(&instruction_source, threads)?;
|
||||||
|
|
||||||
|
// let mut frames: Vec<Mat> = Vec::new();
|
||||||
|
// loop {
|
||||||
|
// // let _timer = Timer::new("Reading frame (clone included)");
|
||||||
|
// video.read(&mut frame)?;
|
||||||
|
|
||||||
|
// //If it reads an empty image, the video stopped
|
||||||
|
// if frame.cols() == 0 {
|
||||||
|
// break;
|
||||||
|
// }
|
||||||
|
|
||||||
|
// frames.push(frame.clone());
|
||||||
|
// }
|
||||||
|
|
||||||
|
// //Required so that data is continuous between each thread
|
||||||
|
// let chunk_size = (frames.len() / settings.threads) + 1;
|
||||||
|
|
||||||
|
// let mut spool = Vec::new();
|
||||||
|
// let chunks = frames.chunks(chunk_size);
|
||||||
|
// //Can get rid of final_frame because of this
|
||||||
|
// for chunk in chunks {
|
||||||
|
// let chunk_copy = chunk.to_vec();
|
||||||
|
// //Checks if this is final thread
|
||||||
|
// let final_frame = if spool.len() == settings.threads - 1 {
|
||||||
|
// chunk_copy.len() as i32
|
||||||
|
// } else {
|
||||||
|
// -1
|
||||||
|
// };
|
||||||
|
|
||||||
|
// let thread = thread::spawn(move || {
|
||||||
|
// let mut byte_data = Vec::new();
|
||||||
|
// let mut current_frame = 1;
|
||||||
|
|
||||||
|
// for frame in chunk_copy {
|
||||||
|
// let source = EmbedSource::from(frame, settings.size);
|
||||||
|
|
||||||
|
// let frame_data = match out_mode {
|
||||||
|
// OutputMode::Color => {
|
||||||
|
// read_color(&source, current_frame, final_frame, final_byte).unwrap()
|
||||||
|
// },
|
||||||
|
// OutputMode::Binary => {
|
||||||
|
// let binary_data = read_bw(&source, current_frame, final_frame, final_byte).unwrap();
|
||||||
|
// translate_u8(binary_data).unwrap()
|
||||||
|
// }
|
||||||
|
// };
|
||||||
|
// current_frame += 1;
|
||||||
|
|
||||||
|
// byte_data.extend(frame_data);
|
||||||
|
// }
|
||||||
|
|
||||||
|
// println!("Dislodging thread complete!");
|
||||||
|
// return byte_data;
|
||||||
|
// });
|
||||||
|
|
||||||
|
// spool.push(thread);
|
||||||
|
// }
|
||||||
|
|
||||||
|
// let mut complete_data = Vec::new();
|
||||||
|
// for thread in spool {
|
||||||
|
// let byte_chunk = thread.join().unwrap();
|
||||||
|
// complete_data.extend(byte_chunk);
|
||||||
|
// }
|
||||||
|
|
||||||
|
// println!("Video read succesfully");
|
||||||
|
// return Ok(complete_data);
|
||||||
|
// }
|
35
src/main.rs
Normal file
35
src/main.rs
Normal file
@ -0,0 +1,35 @@
|
|||||||
|
mod args;
|
||||||
|
mod embedsource;
|
||||||
|
mod etcher;
|
||||||
|
mod run_tasks;
|
||||||
|
mod settings;
|
||||||
|
mod timer;
|
||||||
|
mod ui;
|
||||||
|
|
||||||
|
use clap::Parser;
|
||||||
|
|
||||||
|
use crate::args::Arguments;
|
||||||
|
|
||||||
|
//Make RGB a struct
|
||||||
|
//Make it calculate how much data is jammed in 1 frame for user
|
||||||
|
#[tokio::main]
|
||||||
|
async fn main() -> anyhow::Result<()> {
|
||||||
|
println!("Welcome to ISG (Infinite Storage Glitch)");
|
||||||
|
println!("This tool allows you to turn any file into a compression-resistant video that can be uploaded to YouTube for Infinite Storage:tm:");
|
||||||
|
println!("\nHow to use:");
|
||||||
|
println!("1. Zip all the files you will be uploading");
|
||||||
|
println!("2. Use the embed option on the archive (THE VIDEO WILL BE SEVERAL TIMES LARGER THAN THE FILE, 4x in case of optimal compression resistance preset)");
|
||||||
|
println!(
|
||||||
|
"3. Upload the video to your YouTube channel. You probably want to keep it up as unlisted"
|
||||||
|
);
|
||||||
|
println!("4. Use the download option to get the video back");
|
||||||
|
println!("5. Use the dislodge option to get your files back from the downloaded video");
|
||||||
|
println!("6. PROFIT\n");
|
||||||
|
|
||||||
|
let mut args = Arguments::parse();
|
||||||
|
let new_command = ui::enrich_arguments(args.command).await?;
|
||||||
|
args.command = Some(new_command);
|
||||||
|
|
||||||
|
run_tasks::run_by_arguments(args).await?;
|
||||||
|
Ok(())
|
||||||
|
}
|
56
src/note.txt
Normal file
56
src/note.txt
Normal file
@ -0,0 +1,56 @@
|
|||||||
|
After-project ideas:
|
||||||
|
Fix
|
||||||
|
Code clean-up
|
||||||
|
Optimize (Find optimization tool)
|
||||||
|
Encryption (Kind of unnecessary given archive passwords)
|
||||||
|
Fix weird bug
|
||||||
|
|
||||||
|
Benchmark notes (Tested on an M1 macbook):
|
||||||
|
|
||||||
|
Embed speed:
|
||||||
|
450 kb/s average, 4x size, optimal resistance
|
||||||
|
350 kb/s average, 11x-12x size, paranoid resistance
|
||||||
|
31.9 mb/s average, 1x size, maximum efficiency
|
||||||
|
(A lot of this time is just creating the file after the frames are made)
|
||||||
|
|
||||||
|
~8.5ms per frame, optimal resistance
|
||||||
|
~5.8ms per frame, paranoid resistance
|
||||||
|
~0.16ms per frame, maximum efficiency
|
||||||
|
|
||||||
|
Probably faster on paranoid because it has to read less ?
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
Fix the weird bug (GIVED UP, DO LATER)
|
||||||
|
Make blocks start from top right corner (Gives me even sizes)
|
||||||
|
make it so differentiates between regular, 16:9 size and actual size
|
||||||
|
Embedding or reading an imperfect causes bugs
|
||||||
|
Not sure if a problem of embedding or reading
|
||||||
|
Might be get_pixel
|
||||||
|
It's not overlapping, I'm sure
|
||||||
|
I noticed that every second frame seems broken
|
||||||
|
It stops me from using anything other than 360p/720p
|
||||||
|
Might have something built in
|
||||||
|
Might be the length of file written in instructions
|
16
src/run_tasks.rs
Normal file
16
src/run_tasks.rs
Normal file
@ -0,0 +1,16 @@
|
|||||||
|
use crate::args::Arguments;
|
||||||
|
|
||||||
|
pub mod dislodge;
|
||||||
|
pub mod download;
|
||||||
|
pub mod embed;
|
||||||
|
|
||||||
|
pub async fn run_by_arguments(args: Arguments) -> anyhow::Result<()> {
|
||||||
|
match args
|
||||||
|
.command
|
||||||
|
.expect("Command was not provided by the time run_by_arguments is used")
|
||||||
|
{
|
||||||
|
crate::args::Commands::Embed(args) => embed::run_embed(args).await,
|
||||||
|
crate::args::Commands::Download(args) => download::run_download(args).await,
|
||||||
|
crate::args::Commands::Dislodge(args) => dislodge::run_dislodge(args).await,
|
||||||
|
}
|
||||||
|
}
|
10
src/run_tasks/dislodge.rs
Normal file
10
src/run_tasks/dislodge.rs
Normal file
@ -0,0 +1,10 @@
|
|||||||
|
use crate::{args::DislodgeParams, etcher};
|
||||||
|
|
||||||
|
pub async fn run_dislodge(args: DislodgeParams) -> anyhow::Result<()> {
|
||||||
|
let out_data = etcher::read(&args.in_path.expect("no in path at run_dislodge"), 1)?;
|
||||||
|
etcher::write_bytes(
|
||||||
|
&args.out_path.expect("no out path at run_dislodge"),
|
||||||
|
out_data,
|
||||||
|
)?;
|
||||||
|
Ok(())
|
||||||
|
}
|
42
src/run_tasks/download.rs
Normal file
42
src/run_tasks/download.rs
Normal file
@ -0,0 +1,42 @@
|
|||||||
|
use youtube_dl::{download_yt_dlp};
|
||||||
|
use std::process::Command;
|
||||||
|
|
||||||
|
use crate::args::DownloadParams;
|
||||||
|
|
||||||
|
pub async fn run_download(args: DownloadParams) -> anyhow::Result<()> {
|
||||||
|
let yt_dlp_path = download_yt_dlp(".").await?;
|
||||||
|
|
||||||
|
let url = args.url.expect("No URL in params when run_download");
|
||||||
|
|
||||||
|
// check if the yt_dlp_path exists
|
||||||
|
if !yt_dlp_path.exists() {
|
||||||
|
println!("yt-dlp not found");
|
||||||
|
return Ok(());
|
||||||
|
}
|
||||||
|
|
||||||
|
// Output path for the video has the format: `downloaded_{timestamp}.mp4`
|
||||||
|
let timestamp = chrono::Local::now().format("%Y-%m-%d_%H-%M-%S");
|
||||||
|
let download_path = format!("downloaded_{}.mp4", timestamp);
|
||||||
|
|
||||||
|
// Use the yt-dlp binary to download the video: `yt-dlp -f mp4 -o video.mp4 {url}`
|
||||||
|
println!("Starting the download, there is no progress bar");
|
||||||
|
let output = Command::new(yt_dlp_path)
|
||||||
|
.arg("-f") // format
|
||||||
|
.arg("mp4") // mp4
|
||||||
|
.arg("-o") // output
|
||||||
|
.arg(download_path.clone()) // output path
|
||||||
|
.arg(url) // url to download from
|
||||||
|
.output()
|
||||||
|
.expect("Failed to execute command");
|
||||||
|
|
||||||
|
// check the output of the command
|
||||||
|
if output.status.success() {
|
||||||
|
println!("Video downloaded successfully");
|
||||||
|
println!("Output path: {}", std::fs::canonicalize(download_path).unwrap().display());
|
||||||
|
} else {
|
||||||
|
println!("Video download failed");
|
||||||
|
println!("Error: {}", String::from_utf8_lossy(&output.stderr));
|
||||||
|
}
|
||||||
|
|
||||||
|
return Ok(());
|
||||||
|
}
|
95
src/run_tasks/embed.rs
Normal file
95
src/run_tasks/embed.rs
Normal file
@ -0,0 +1,95 @@
|
|||||||
|
use crate::{
|
||||||
|
args::{EmbedParams, EmbedPreset},
|
||||||
|
etcher,
|
||||||
|
settings::{Data, OutputMode, Settings},
|
||||||
|
};
|
||||||
|
|
||||||
|
pub async fn run_embed(args: EmbedParams) -> anyhow::Result<()> {
|
||||||
|
//Should use enums
|
||||||
|
let mut settings = Settings::default();
|
||||||
|
let mut output_mode = OutputMode::Binary;
|
||||||
|
|
||||||
|
match args.preset {
|
||||||
|
Some(EmbedPreset::MaxEfficiency) => {
|
||||||
|
output_mode = OutputMode::Color;
|
||||||
|
settings.size = 1;
|
||||||
|
settings.threads = 8;
|
||||||
|
settings.fps = 10.0;
|
||||||
|
settings.width = 256;
|
||||||
|
settings.height = 144;
|
||||||
|
}
|
||||||
|
Some(EmbedPreset::Optimal) => {
|
||||||
|
output_mode = OutputMode::Binary;
|
||||||
|
settings.size = 2;
|
||||||
|
settings.threads = 8;
|
||||||
|
settings.fps = 10.0;
|
||||||
|
settings.width = 1280;
|
||||||
|
settings.height = 720;
|
||||||
|
}
|
||||||
|
Some(EmbedPreset::Paranoid) => {
|
||||||
|
output_mode = OutputMode::Binary;
|
||||||
|
|
||||||
|
settings.size = 4;
|
||||||
|
settings.threads = 8;
|
||||||
|
settings.fps = 10.0;
|
||||||
|
settings.width = 1280;
|
||||||
|
settings.height = 720;
|
||||||
|
}
|
||||||
|
_ => (),
|
||||||
|
}
|
||||||
|
|
||||||
|
// If none of the presets were picked,
|
||||||
|
// then all the parameters are included in the args,
|
||||||
|
// so it is safe to gather them from the args now
|
||||||
|
|
||||||
|
if settings.width == 0 || settings.height == 0 {
|
||||||
|
if args.resolution.is_none() {
|
||||||
|
settings.width = 640;
|
||||||
|
settings.height = 360;
|
||||||
|
} else {
|
||||||
|
let (width, height) = match args.resolution.unwrap().as_str() {
|
||||||
|
"144p" => (256, 144),
|
||||||
|
"240p" => (426, 240),
|
||||||
|
"360p" => (640, 360),
|
||||||
|
"480p" => (854, 480),
|
||||||
|
"720p" => (1280, 720),
|
||||||
|
_ => (640, 360),
|
||||||
|
};
|
||||||
|
settings.width = width;
|
||||||
|
settings.height = height;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
if let Some(mode) = args.mode {
|
||||||
|
output_mode = mode.into();
|
||||||
|
}
|
||||||
|
if let Some(bs) = args.block_size {
|
||||||
|
settings.size = bs;
|
||||||
|
}
|
||||||
|
if let Some(threads) = args.threads {
|
||||||
|
settings.threads = threads;
|
||||||
|
}
|
||||||
|
if let Some(fps) = args.fps {
|
||||||
|
settings.fps = fps.into();
|
||||||
|
}
|
||||||
|
|
||||||
|
match output_mode {
|
||||||
|
OutputMode::Color => {
|
||||||
|
let bytes = etcher::rip_bytes(&args.in_path.expect("no path in arguments"))?;
|
||||||
|
|
||||||
|
let data = Data::from_color(bytes);
|
||||||
|
|
||||||
|
etcher::etch("output.avi", data, settings)?;
|
||||||
|
}
|
||||||
|
OutputMode::Binary => {
|
||||||
|
let bytes = etcher::rip_bytes(&args.in_path.expect("no path in arguments"))?;
|
||||||
|
let binary = etcher::rip_binary(bytes)?;
|
||||||
|
|
||||||
|
let data = Data::from_binary(binary);
|
||||||
|
|
||||||
|
etcher::etch("output.avi", data, settings)?;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
Ok(())
|
||||||
|
}
|
60
src/settings.rs
Normal file
60
src/settings.rs
Normal file
@ -0,0 +1,60 @@
|
|||||||
|
#[derive(PartialEq, Eq, Debug, Copy, Clone)]
|
||||||
|
pub enum OutputMode {
|
||||||
|
Binary,
|
||||||
|
Color,
|
||||||
|
}
|
||||||
|
|
||||||
|
pub struct Data {
|
||||||
|
pub bytes: Vec<u8>,
|
||||||
|
pub binary: Vec<bool>,
|
||||||
|
pub out_mode: OutputMode,
|
||||||
|
}
|
||||||
|
|
||||||
|
//Get rid of possible empty spaces
|
||||||
|
impl Data {
|
||||||
|
#[allow(dead_code)]
|
||||||
|
pub fn new_out_mode(out_mode: OutputMode) -> Data {
|
||||||
|
Data {
|
||||||
|
bytes: Vec::new(),
|
||||||
|
binary: Vec::new(),
|
||||||
|
out_mode,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
pub fn from_binary(binary: Vec<bool>) -> Data {
|
||||||
|
Data {
|
||||||
|
bytes: Vec::new(),
|
||||||
|
binary,
|
||||||
|
out_mode: OutputMode::Binary,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
pub fn from_color(bytes: Vec<u8>) -> Data {
|
||||||
|
Data {
|
||||||
|
bytes,
|
||||||
|
binary: Vec::new(),
|
||||||
|
out_mode: OutputMode::Color,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
#[derive(Debug, Default)]
|
||||||
|
pub struct Settings {
|
||||||
|
pub size: i32,
|
||||||
|
pub threads: usize,
|
||||||
|
pub fps: f64,
|
||||||
|
pub width: i32,
|
||||||
|
pub height: i32,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl Settings {
|
||||||
|
pub fn new(size: i32, threads: usize, fps: i32, width: i32, height: i32) -> Settings {
|
||||||
|
Settings {
|
||||||
|
size,
|
||||||
|
threads,
|
||||||
|
fps: fps as f64,
|
||||||
|
height,
|
||||||
|
width,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
BIN
src/tests/Baby.wav
Executable file
BIN
src/tests/Baby.wav
Executable file
Binary file not shown.
BIN
src/tests/Big.jpg
Executable file
BIN
src/tests/Big.jpg
Executable file
Binary file not shown.
After Width: | Height: | Size: 5.2 MiB |
BIN
src/tests/img1.png
Normal file
BIN
src/tests/img1.png
Normal file
Binary file not shown.
After Width: | Height: | Size: 584 KiB |
BIN
src/tests/img2.png
Normal file
BIN
src/tests/img2.png
Normal file
Binary file not shown.
After Width: | Height: | Size: 263 KiB |
1
src/tests/test.txt
Normal file
1
src/tests/test.txt
Normal file
File diff suppressed because one or more lines are too long
26
src/timer.rs
Normal file
26
src/timer.rs
Normal file
@ -0,0 +1,26 @@
|
|||||||
|
use std::time::Instant;
|
||||||
|
|
||||||
|
pub struct Timer {
|
||||||
|
title: &'static str,
|
||||||
|
time: Instant,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl Drop for Timer {
|
||||||
|
fn drop(&mut self) {
|
||||||
|
let micros = self.time.elapsed().as_micros();
|
||||||
|
let millis = self.time.elapsed().as_millis();
|
||||||
|
|
||||||
|
if micros < 10000 {
|
||||||
|
println!("{} ended in {}us", self.title, micros);
|
||||||
|
} else {
|
||||||
|
println!("{} ended in {}ms", self.title, millis);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
impl Timer {
|
||||||
|
pub fn new(title: &'static str) -> Timer {
|
||||||
|
let start = Instant::now();
|
||||||
|
Timer { title, time: start }
|
||||||
|
}
|
||||||
|
}
|
188
src/ui.rs
Normal file
188
src/ui.rs
Normal file
@ -0,0 +1,188 @@
|
|||||||
|
use anyhow;
|
||||||
|
#[allow(unused_imports)]
|
||||||
|
use inquire::{min_length, Confirm, CustomType, MultiSelect, Password, Select, Text};
|
||||||
|
|
||||||
|
use crate::args::{Commands, DislodgeParams, DownloadParams, EmbedParams};
|
||||||
|
|
||||||
|
pub async fn enrich_arguments(args: Option<Commands>) -> anyhow::Result<Commands> {
|
||||||
|
// If we already know which mode we would run, defer to that mode.
|
||||||
|
// Else, get the mode from the user, and defer to the mode.
|
||||||
|
Ok(match args {
|
||||||
|
Some(Commands::Embed(embed_args)) => {
|
||||||
|
Commands::Embed(enrich_embed_params(embed_args).await?)
|
||||||
|
}
|
||||||
|
Some(Commands::Download(download_args)) => {
|
||||||
|
Commands::Download(enrich_download_params(download_args).await?)
|
||||||
|
}
|
||||||
|
Some(Commands::Dislodge(dislodge_args)) => {
|
||||||
|
Commands::Dislodge(enrich_dislodge_params(dislodge_args).await?)
|
||||||
|
}
|
||||||
|
None => {
|
||||||
|
let options = vec!["Embed", "Download", "Dislodge"];
|
||||||
|
|
||||||
|
let modes = Select::new("Pick what you want to do with the program", options)
|
||||||
|
.with_help_message("Embed: Create a video from files,\n Download: Download files stored on YouTube,\n Dislodge: Return files from an embedded video")
|
||||||
|
.prompt()
|
||||||
|
.unwrap();
|
||||||
|
|
||||||
|
match modes {
|
||||||
|
"Embed" => Commands::Embed(enrich_embed_params(EmbedParams::default()).await?),
|
||||||
|
"Download" => {
|
||||||
|
Commands::Download(enrich_download_params(DownloadParams::default()).await?)
|
||||||
|
}
|
||||||
|
"Dislodge" => {
|
||||||
|
Commands::Dislodge(enrich_dislodge_params(DislodgeParams::default()).await?)
|
||||||
|
}
|
||||||
|
_ => unreachable!(),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
})
|
||||||
|
}
|
||||||
|
|
||||||
|
async fn enrich_embed_params(mut args: EmbedParams) -> anyhow::Result<EmbedParams> {
|
||||||
|
if args.in_path.is_none() {
|
||||||
|
let path = Text::new("What is the path to your file ?")
|
||||||
|
.with_default("src/tests/test.txt")
|
||||||
|
.prompt()
|
||||||
|
.unwrap();
|
||||||
|
args.in_path = Some(path);
|
||||||
|
}
|
||||||
|
|
||||||
|
// If any of the advanced options is set,
|
||||||
|
// then ask for the remaining advanced options.
|
||||||
|
// If none are set, ask for a preset first, and if custom is selected,
|
||||||
|
// then fall through to the advanced options.
|
||||||
|
// This must be after all the other options were parsed,
|
||||||
|
// because if preset is set, this returns.
|
||||||
|
|
||||||
|
println!("\nI couldn't figure out a weird bug that happens if you set the size to something that isn't a factor of the height");
|
||||||
|
println!("If you don't want the files you put in to come out as the audio/visual equivalent of a pipe bomb, account for the above bug\n");
|
||||||
|
|
||||||
|
if args.mode.is_none()
|
||||||
|
&& args.block_size.is_none()
|
||||||
|
&& args.threads.is_none()
|
||||||
|
&& args.fps.is_none()
|
||||||
|
&& args.resolution.is_none()
|
||||||
|
{
|
||||||
|
let presets = vec![
|
||||||
|
"Optimal compression resistance",
|
||||||
|
"Paranoid compression resistance",
|
||||||
|
"Maximum efficiency",
|
||||||
|
"Custom",
|
||||||
|
];
|
||||||
|
let preset = Select::new("You can use one of the existing presets or custom settings", presets.clone())
|
||||||
|
.with_help_message("Any amount of compression on Maximum Efficiency will corrupt all your hopes and dreams")
|
||||||
|
.prompt()
|
||||||
|
.unwrap();
|
||||||
|
|
||||||
|
match preset {
|
||||||
|
"Maximum efficiency" => {
|
||||||
|
args.preset = Some(crate::args::EmbedPreset::MaxEfficiency);
|
||||||
|
return Ok(args);
|
||||||
|
}
|
||||||
|
"Optimal compression resistance" => {
|
||||||
|
args.preset = Some(crate::args::EmbedPreset::Optimal);
|
||||||
|
return Ok(args);
|
||||||
|
}
|
||||||
|
"Paranoid compression resistance" => {
|
||||||
|
args.preset = Some(crate::args::EmbedPreset::Paranoid);
|
||||||
|
return Ok(args);
|
||||||
|
}
|
||||||
|
_ => (),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Now, either custom is selected or some CLI arguments are set.
|
||||||
|
// Ask advanced questions now.
|
||||||
|
|
||||||
|
if args.mode.is_none() {
|
||||||
|
let out_modes = vec!["Colored", "B/W (Binary)"];
|
||||||
|
let out_mode = Select::new("Pick how data will be embedded", out_modes.clone())
|
||||||
|
.with_help_message("Colored mode is useless if the video undergoes compression at any point, B/W survives compression")
|
||||||
|
.prompt()
|
||||||
|
.unwrap();
|
||||||
|
args.mode = Some(match out_mode {
|
||||||
|
"Colored" => crate::args::EmbedOutputMode::Colored,
|
||||||
|
"B/W (Binary)" => crate::args::EmbedOutputMode::Binary,
|
||||||
|
_ => unreachable!(),
|
||||||
|
});
|
||||||
|
}
|
||||||
|
|
||||||
|
if args.block_size.is_none() {
|
||||||
|
let size = CustomType::<i32>::new("What size should the blocks be ?")
|
||||||
|
.with_error_message("Please type a valid number")
|
||||||
|
.with_help_message("Bigger blocks are more resistant to compression, I recommend 2-5.")
|
||||||
|
.with_default(2)
|
||||||
|
.prompt()?;
|
||||||
|
args.block_size = Some(size);
|
||||||
|
}
|
||||||
|
|
||||||
|
if args.threads.is_none() {
|
||||||
|
let threads = CustomType::<usize>::new("How many threads to dedicate for processing ?")
|
||||||
|
.with_error_message("Please type a valid number")
|
||||||
|
.with_help_message("The more threads, the merrier")
|
||||||
|
.with_default(8)
|
||||||
|
.prompt()?;
|
||||||
|
args.threads = Some(threads);
|
||||||
|
}
|
||||||
|
|
||||||
|
if args.fps.is_none() {
|
||||||
|
let fps = CustomType::<i32>::new("What fps should the video be at ?")
|
||||||
|
.with_error_message("Please type a valid number")
|
||||||
|
.with_help_message("Decreasing fps may decrease chance of compression. ~10fps works")
|
||||||
|
.with_default(10)
|
||||||
|
.prompt()
|
||||||
|
.expect("Invalid fps");
|
||||||
|
args.fps = Some(fps);
|
||||||
|
}
|
||||||
|
|
||||||
|
let resolutions = vec!["144p", "240p", "360p", "480p", "720p"];
|
||||||
|
|
||||||
|
if args.resolution.is_none() {
|
||||||
|
//Check if higher resolution runs faster
|
||||||
|
let resolution = Select::new("Pick a resolution", resolutions)
|
||||||
|
.with_help_message("I recommend 720p as the resolution won't affect compression")
|
||||||
|
.prompt()
|
||||||
|
.unwrap();
|
||||||
|
args.resolution = Some(resolution.to_string());
|
||||||
|
}
|
||||||
|
|
||||||
|
Ok(args)
|
||||||
|
}
|
||||||
|
|
||||||
|
async fn enrich_download_params(mut args: DownloadParams) -> anyhow::Result<DownloadParams> {
|
||||||
|
if args.url.is_none() {
|
||||||
|
let url = Text::new("What is the url to the video ?")
|
||||||
|
.prompt()
|
||||||
|
.unwrap();
|
||||||
|
args.url = Some(url);
|
||||||
|
}
|
||||||
|
Ok(args)
|
||||||
|
}
|
||||||
|
|
||||||
|
//TEMPORARY DEFAULTS
|
||||||
|
async fn enrich_dislodge_params(mut args: DislodgeParams) -> anyhow::Result<DislodgeParams> {
|
||||||
|
if args.in_path.is_none() {
|
||||||
|
let in_path = Text::new("What is the path to your video ?")
|
||||||
|
.with_default("output.avi")
|
||||||
|
.prompt()
|
||||||
|
.unwrap();
|
||||||
|
args.in_path = Some(in_path);
|
||||||
|
}
|
||||||
|
|
||||||
|
if args.out_path.is_none() {
|
||||||
|
let out_path = Text::new("Where should the output go ?")
|
||||||
|
.with_help_message("Please include name of file and extension")
|
||||||
|
.prompt()
|
||||||
|
.unwrap();
|
||||||
|
args.out_path = Some(out_path);
|
||||||
|
}
|
||||||
|
|
||||||
|
// let threads = CustomType::<usize>::new("How many threads to dedicate for processing ?")
|
||||||
|
// .with_error_message("Please type a valid number")
|
||||||
|
// .with_help_message("The more threads, the merrier")
|
||||||
|
// .with_default(8)
|
||||||
|
// .prompt()?;
|
||||||
|
|
||||||
|
Ok(args)
|
||||||
|
}
|
Loading…
Reference in New Issue
Block a user