lotobo/archive-tools
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 2 Wiki Activity

Release Archive Tools 0.1.0

Browse Source
This commit is contained in:
zemion
2026-09-01 02:42:42 +02:00
commit a49ec6b17a
77 changed files with 11528 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
.gitignore
+9
View File
@@ -0,0 +1,9 @@
node_modules/
dist/
release/*.zip
release/*.zip.sha256
coverage/
playwright-report/
test-results/
*.tsbuildinfo
.DS_Store
.npmrc
+1
View File
@@ -0,0 +1 @@
@add-ideas:registry=https://git.add-ideas.de/api/packages/lotobo/npm/
CHANGELOG.md
+13
View File
@@ -0,0 +1,13 @@
# Changelog
## 0.1.0 - 2026-09-01
- Added the initial local-first Archive Tools workbench.
- Added bounded ZIP and ZIP64 inspection through zip.js with collision-safe paths, encryption/multipart/special-entry refusal and CRC/local-header verification when reading content.
- Added project-owned TAR/USTAR/PAX parsing and deterministic TAR/PAX writing with checked offsets and header checksums.
- Added bounded gzip/tar.gz processing with CRC-32 and ISIZE verification.
- Added safe plain-text, hexadecimal and static JPEG/PNG/WebP previews with no active-content rendering.
- Added selective verification and repackaging into a newly created safe ZIP.
- Added deterministic ZIP, TAR and tar.gz creation and cross-format archive comparison.
- Added JSON inspection/comparison reports, explicit resource limits, browser-local processing and responsive Toolbox integration.
- Added unit, security-regression and Chromium/Firefox browser gates.
CONTRIBUTING.md
+3
View File
@@ -0,0 +1,3 @@
# Contributing
Run `npm ci`, `npm run check`, and `npm run test:browser` before proposing a change. Keep processing local, preserve explicit limits, and include fixtures for every parser boundary.
LICENSE
+674
View 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>.
LICENSES/README.md
+3
View File
@@ -0,0 +1,3 @@
# Licences
The application is GPL-3.0-or-later. Runtime components include Apache-2.0 Toolbox SDK packages, BSD-3-Clause zip.js, and MIT-licensed fflate, React and React DOM. Generated release artifacts include an exact runtime dependency licence inventory in `npm-runtime-licenses.txt`.
README.md
+61
View File
@@ -0,0 +1,61 @@
# Archive Tools
Inspect, create, compare and safely extract archives locally.
Archive Tools is a standalone local-first application in the [add·ideas Toolbox](https://git.add-ideas.de/lotobo/toolbox-portal). Inputs are processed in the browser and are not uploaded.
## Version 0.1 scope
- Inspect ZIP and ZIP64 central directories, TAR/USTAR/PAX archives, gzip streams and tar.gz archives.
- List normalized paths, kinds, sizes, compression, timestamps, ZIP64 state, CRC-32 values and policy diagnostics.
- Preview bounded UTF-8 text, hexadecimal bytes and static JPEG/PNG/WebP images. HTML and SVG are shown as text, never rendered as active content.
- Select regular safe files, verify their bytes and CRC where available, and repackage them into a newly created ZIP. Archive paths are never restored directly to a filesystem.
- Create deterministic ZIP, TAR/PAX and tar.gz output from local files with sorted paths and normalized metadata.
- Compare two archive inventories by collision-safe path, entry kind, expanded size and CRC-32, independent of container format and timestamps.
- Download machine-readable inspection and comparison reports.
Encryption, split/multipart ZIPs, nested archive expansion, GNU TAR extensions, symlinks, hardlinks, devices and FIFOs are intentionally unsupported. Those entry kinds are either rejected or listed as blocked; they are never restored.
The application treats every imported file as untrusted, applies explicit count/path/expanded-byte/compression-ratio limits, and never executes imported active content. See [docs/ARCHITECTURE.md](docs/ARCHITECTURE.md) and [docs/PRIVACY-SECURITY.md](docs/PRIVACY-SECURITY.md).
## Safety limits
| Resource | Limit |
| -------------------------- | ------------------------------: |
| Source archive | 512 MiB |
| Entries inspected | 20,000 |
| Entries displayed at once | 5,000 |
| Expanded archive bytes | 512 MiB |
| One expanded entry | 256 MiB |
| Compression ratio | 200:1 |
| Path | 4,096 UTF-8 bytes / 64 segments |
| Creation | 5,000 files / 512 MiB |
| Text / hex / image preview | 2 MiB / 128 KiB / 24 MiB |
These are application-level ceilings, not a promise that every device can comfortably process files near the maximum.
## Using the workspaces
1. **Inspect & extract** opens one archive, displays its safety inventory and previews eligible files. Select safe regular files and choose **Verify & download safe ZIP** to create a fresh archive.
2. **Create** accepts local files and produces reproducible ZIP, TAR or tar.gz output. Browser file selection exposes relative paths only when the browser supplies them.
3. **Compare** opens two archives and reports same, changed, type-changed and one-sided entries.
## Development
Requires Node.js 22 and npm 11.
```sh
npm ci
npm run check
npm run test:browser
```
Runtime dependencies are exactly pinned. `npm audit` should be checked with every dependency update.
## Release
`npm run release:artifact` creates a deterministic `release/archive-tools-0.1.0.zip` and checksum sidecar.
## Licence
GPL-3.0-or-later. Runtime dependencies retain their own licences; see [THIRD_PARTY_NOTICES.md](THIRD_PARTY_NOTICES.md).
SECURITY.md
+3
View File
@@ -0,0 +1,3 @@
# Security
Please report vulnerabilities privately to the repository owner. Do not attach sensitive source files to public issues. Imported inputs are untrusted; parsers must remain bounded and must not execute active content or fetch external resources.
SOURCE.md
+7
View File
@@ -0,0 +1,7 @@
# Corresponding source
The corresponding source for Archive Tools 0.1.0 is available at:
https://git.add-ideas.de/lotobo/archive-tools/src/tag/v0.1.0
Build with Node.js 22, npm 11, `npm ci`, and `npm run release:artifact`.
THIRD_PARTY_NOTICES.md
+11
View File
@@ -0,0 +1,11 @@
# Third-party notices
Archive Tools is GPL-3.0-or-later. Its runtime dependencies retain their own licences:
- `@add-ideas/toolbox-contract` 0.2.3 — Apache-2.0
- `@add-ideas/toolbox-shell-react` 0.2.3 — Apache-2.0
- `@zip.js/zip.js` 2.9.0 — BSD-3-Clause
- `fflate` 0.8.3 — MIT
- `react` and `react-dom` 19.2.8 — MIT
Exact versions and integrity hashes are recorded in `package-lock.json`. Release artifacts generate a complete runtime dependency licence inventory at `LICENSES/npm-runtime-licenses.txt`.
docs/ACCESSIBILITY.md
+7
View File
@@ -0,0 +1,7 @@
# Accessibility
The workbench uses semantic landmarks, heading order, labelled native file/search/select controls and real tables with row/column headers. Workspace tabs expose their selected state. Every inventory checkbox includes the corresponding path in its accessible name; blocked controls are disabled rather than visually implied.
Status and parser errors use live `status` and `alert` roles. Safety and comparison states include text and do not rely on colour. Preview images receive entry-derived alternative text; textual and hexadecimal previews remain selectable and scrollable.
All actions are keyboard operable, focus is visible, dense tables scroll rather than clipping, and the layout collapses to one column at narrow widths. Theme selection comes from the shared Toolbox shell. Reduced-motion preferences disable non-essential motion.
docs/ARCHITECTURE.md
+28
View File
@@ -0,0 +1,28 @@
# Architecture
Archive Tools is a relocatable static React application. It has no backend, persistence, telemetry or runtime network dependency.
## Layers
- `src/archive/paths.ts` owns cross-platform path assessment and collision keys. It rejects traversal, absolute/drive/UNC paths, controls, ambiguous segments, Windows devices, alternate streams and excessive depth/length.
- `src/archive/zip.ts` uses exactly pinned `@zip.js/zip.js` for ZIP/ZIP64 inventory, CRC-checked reads and deterministic writing. Listing uses bounded entry iteration. Content reads request strict local/central-header agreement, CRC-32 validation and overlapping-entry checks.
- `src/archive/tar.ts` is a checked-offset TAR/USTAR/PAX reader and deterministic writer. Every header checksum is validated. PAX metadata is capped before UTF-8 decoding.
- `src/archive/gzip.ts` streams compressed input through fflate in small chunks, stops at the expanded-byte ceiling and independently checks the single-member CRC-32 and ISIZE footer. Concatenated members are unsupported.
- `src/archive/service.ts` detects formats, applies aggregate policies and exposes inspection, reading, safe repackaging, creation and reports.
- `src/archive/preview.ts` recognizes only bounded plain text, bytes and static raster images. Nested archives are never recursively expanded.
- `src/archive/compare.ts` compares normalized inventories without interpreting content.
- `src/components/workspaces` contains React views. Imported text is rendered through React text nodes; there is no `dangerouslySetInnerHTML`.
## Data flow
Inspection checks the source size and format before parsing. ZIP inventory reads only archive metadata. TAR and gzip inputs are held in memory only after the source ceiling is satisfied and gzip expansion is stopped at its output ceiling. TAR/gzip payloads remain in the current React document solely to support later previews and selection; replacing the document releases those references.
Preview and extraction never write source paths to the local filesystem. A selected entry is decoded into a bounded in-memory buffer, verified, and passed to a new deterministic ZIP writer using its already-assessed normalized path.
## Determinism
Creation sorts normalized paths by code-unit order. ZIP uses zip.js's bundled DEFLATE implementation at level 6 with native compression streams and workers disabled, fixed DOS dates, normalized regular-file modes, no extended timestamps and no data descriptors. TAR uses zero timestamps/IDs, regular mode `0644`, USTAR when possible and deterministic PAX path headers otherwise. gzip uses level 6 and mtime zero.
## Memory model
The parser refuses unsafe declared sizes before entry decompression. A bounded writable collects ZIP output and stops when actual output crosses the operation ceiling. gzip is pushed in 32 KiB source chunks and output is counted before retention. Creation and TAR parsing are deliberately capped because they currently use in-memory output/payloads.
docs/PRIVACY-SECURITY.md
+32
View File
@@ -0,0 +1,32 @@
# Privacy and security
## Privacy
Inputs remain in the browser. There is no telemetry, account, analytics, upload endpoint, persistence or runtime CDN. Object URLs exist only long enough to display or download local results and are revoked after use.
## Threat model
Archives are adversarial binary input. Relevant risks include traversal and alternate-stream names, normalization/case collisions, deceptive local versus central ZIP headers, overlapping ZIP entries, CRC corruption, compression bombs, integer overflow, excessive counts, malformed PAX lengths, active HTML/SVG, recursive nested archives and special filesystem entries.
Archive Tools responds as follows:
- source, count, expanded-byte, per-entry, ratio, path and preview budgets are fixed in `src/archive/limits.ts`;
- byte arithmetic uses checked safe integers and bounds before slicing;
- extraction never targets the filesystem: eligible content is verified and repackaged into a newly created ZIP;
- ZIP content reads enable CRC-32, strict local/central agreement and overlapping-entry checks;
- every TAR header checksum is verified, PAX metadata is bounded and GNU long-name extensions are refused;
- gzip output is counted during streaming and its CRC-32/ISIZE footer is independently verified;
- path collision keys are Unicode-normalized and conservative across case-insensitive platforms;
- symlinks, hardlinks, devices, FIFOs and unknown types are never restored;
- imported text is rendered as text, and HTML/SVG are not mounted as documents;
- raster images must pass byte/dimension/pixel/static checks before a browser decoder sees their Blob URL;
- nested archives are shown as bytes and never recursively opened;
- encrypted and multipart ZIP data is unsupported, with no password collection.
## Limits
The primary ceilings are 512 MiB source and aggregate expanded data, 256 MiB per entry, 20,000 entries and a 200:1 compression ratio. Preview limits are substantially smaller. Near-limit workloads may still be impractical on low-memory devices; the limits reduce risk but do not make untrusted archives inherently safe.
## Output meaning
“Safe file” means eligible for bounded verification and inclusion in a new ZIP under this policy. It is not a malware verdict. Archive Tools does not scan file semantics and does not make copied files trustworthy to open in another application.
eslint.config.mjs
+37
View File
@@ -0,0 +1,37 @@
import js from "@eslint/js";
import globals from "globals";
import reactHooks from "eslint-plugin-react-hooks";
import reactRefresh from "eslint-plugin-react-refresh";
import tseslint from "typescript-eslint";
export default tseslint.config(
{
ignores: [
"dist",
"release",
"coverage",
"test-results",
"playwright-report",
],
},
{
extends: [js.configs.recommended, ...tseslint.configs.recommended],
files: ["**/*.{ts,tsx}"],
languageOptions: {
ecmaVersion: 2023,
globals: { ...globals.browser, ...globals.worker },
},
plugins: { "react-hooks": reactHooks, "react-refresh": reactRefresh },
rules: {
...reactHooks.configs.recommended.rules,
"react-refresh/only-export-components": [
"warn",
{ allowConstantExport: true },
],
},
},
{
files: ["scripts/**/*.mjs", "playwright.config.ts"],
languageOptions: { globals: globals.node },
},
);
index.html
+19
View File
@@ -0,0 +1,19 @@
<!doctype html>
<html lang="en">
<head>
<meta charset="UTF-8" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<meta
name="description"
content="Inspect, create, compare and safely extract archives locally."
/>
<link rel="icon" type="image/svg+xml" href="./favicon.svg" />
<link rel="manifest" href="./manifest.webmanifest" />
<meta name="theme-color" content="#29255f" />
<title>Archive Tools</title>
</head>
<body>
<div id="root"></div>
<script type="module" src="./src/main.tsx"></script>
</body>
</html>
package-lock.json
Generated
+3991
View File
File diff suppressed because it is too large Load Diff
package.json
+72
View File
@@ -0,0 +1,72 @@
{
"name": "archive-tools",
"version": "0.1.0",
"description": "Inspect, create, compare and safely extract archives locally.",
"license": "GPL-3.0-or-later",
"author": "Albrecht Degering",
"repository": {
"type": "git",
"url": "git+https://git.add-ideas.de/lotobo/archive-tools.git"
},
"homepage": "https://git.add-ideas.de/lotobo/archive-tools",
"bugs": {
"url": "https://git.add-ideas.de/lotobo/archive-tools/issues"
},
"private": true,
"type": "module",
"engines": {
"node": ">=22"
},
"scripts": {
"predev": "npm run manifest:generate",
"dev": "vite",
"prebuild": "npm run release:prepare && npm run manifest:generate",
"build": "tsc -b && vite build",
"preview": "vite preview",
"typecheck": "tsc -b --pretty false",
"lint": "eslint . --max-warnings=0",
"format": "prettier --write .",
"format:check": "prettier --check .",
"test": "vitest run",
"test:watch": "vitest",
"test:browser": "playwright test",
"manifest:generate": "node scripts/generate-toolbox-manifest.mjs",
"manifest:check": "node scripts/generate-toolbox-manifest.mjs --check",
"release:prepare": "node scripts/prepare-release-files.mjs",
"toolbox:check": "toolbox-check dist",
"package:release": "node scripts/package-release.mjs",
"check": "npm run manifest:check && npm run typecheck && npm run lint && npm run format:check && npm run test && npm run build && npm run toolbox:check",
"release:artifact": "npm run check && npm run test:browser && npm run package:release -- --force"
},
"dependencies": {
"@add-ideas/toolbox-contract": "0.2.3",
"@add-ideas/toolbox-shell-react": "0.2.3",
"@zip.js/zip.js": "2.9.0",
"fflate": "0.8.3",
"react": "19.2.8",
"react-dom": "19.2.8"
},
"devDependencies": {
"@add-ideas/toolbox-testkit": "0.2.3",
"@eslint/js": "10.0.1",
"@playwright/test": "1.62.1",
"@testing-library/jest-dom": "6.9.1",
"@testing-library/react": "16.3.2",
"@testing-library/user-event": "14.6.1",
"@types/node": "25.9.5",
"@types/react": "19.2.17",
"@types/react-dom": "19.2.5",
"@vitejs/plugin-react": "6.0.3",
"eslint": "10.7.0",
"eslint-plugin-react-hooks": "7.1.1",
"eslint-plugin-react-refresh": "0.5.2",
"globals": "17.7.0",
"jsdom": "29.1.1",
"prettier": "3.9.5",
"typescript": "6.0.3",
"typescript-eslint": "8.64.0",
"vite": "8.2.2",
"vitest": "4.1.11"
},
"packageManager": "npm@11.17.0"
}
playwright.config.ts
+21
View File
@@ -0,0 +1,21 @@
import { defineConfig, devices } from "@playwright/test";
export default defineConfig({
testDir: "./tests/browser",
fullyParallel: false,
workers: 1,
timeout: 120_000,
expect: { timeout: 10_000 },
reporter: [["list"]],
use: { baseURL: "http://127.0.0.1:4173", trace: "retain-on-failure" },
webServer: {
command: "npm run build && node scripts/serve-test.mjs",
url: "http://127.0.0.1:4173",
reuseExistingServer: !process.env.CI,
timeout: 180_000,
},
projects: [
{ name: "chromium", use: { ...devices["Desktop Chrome"] } },
{ name: "firefox", use: { ...devices["Desktop Firefox"] } },
],
});
public/CHANGELOG.md
+13
View File
@@ -0,0 +1,13 @@
# Changelog
## 0.1.0 - 2026-09-01
- Added the initial local-first Archive Tools workbench.
- Added bounded ZIP and ZIP64 inspection through zip.js with collision-safe paths, encryption/multipart/special-entry refusal and CRC/local-header verification when reading content.
- Added project-owned TAR/USTAR/PAX parsing and deterministic TAR/PAX writing with checked offsets and header checksums.
- Added bounded gzip/tar.gz processing with CRC-32 and ISIZE verification.
- Added safe plain-text, hexadecimal and static JPEG/PNG/WebP previews with no active-content rendering.
- Added selective verification and repackaging into a newly created safe ZIP.
- Added deterministic ZIP, TAR and tar.gz creation and cross-format archive comparison.
- Added JSON inspection/comparison reports, explicit resource limits, browser-local processing and responsive Toolbox integration.
- Added unit, security-regression and Chromium/Firefox browser gates.
public/CONTRIBUTING.md
+3
View File
@@ -0,0 +1,3 @@
# Contributing
Run `npm ci`, `npm run check`, and `npm run test:browser` before proposing a change. Keep processing local, preserve explicit limits, and include fixtures for every parser boundary.
public/LICENSE
+674
View 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>.
public/LICENSES/README.md
+3
View File
@@ -0,0 +1,3 @@
# Licences
The application is GPL-3.0-or-later. Runtime components include Apache-2.0 Toolbox SDK packages, BSD-3-Clause zip.js, and MIT-licensed fflate, React and React DOM. Generated release artifacts include an exact runtime dependency licence inventory in `npm-runtime-licenses.txt`.
public/LICENSES/npm-runtime-licenses.txt
+542
View File
@@ -0,0 +1,542 @@
==============================================================================
@add-ideas/toolbox-contract@0.2.3
Declared licence: Apache-2.0
==============================================================================
--- LICENSE ---
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
1. Definitions.
"License" shall mean the terms and conditions for use, reproduction,
and distribution as defined by Sections 1 through 9 of this document.
"Licensor" shall mean the copyright owner or entity authorized by
the copyright owner that is granting the License.
"Legal Entity" shall mean the union of the acting entity and all
other entities that control, are controlled by, or are under common
control with that entity. For the purposes of this definition,
"control" means (i) the power, direct or indirect, to cause the
direction or management of such entity, whether by contract or
otherwise, or (ii) ownership of fifty percent (50%) or more of the
outstanding shares, or (iii) beneficial ownership of such entity.
"You" (or "Your") shall mean an individual or Legal Entity
exercising permissions granted by this License.
"Source" form shall mean the preferred form for making modifications,
including but not limited to software source code, documentation
source, and configuration files.
"Object" form shall mean any form resulting from mechanical
transformation or translation of a Source form, including but
not limited to compiled object code, generated documentation,
and conversions to other media types.
"Work" shall mean the work of authorship, whether in Source or
Object form, made available under the License, as indicated by a
copyright notice that is included in or attached to the work
(an example is provided in the Appendix below).
"Derivative Works" shall mean any work, whether in Source or Object
form, that is based on (or derived from) the Work and for which the
editorial revisions, annotations, elaborations, or other modifications
represent, as a whole, an original work of authorship. For the purposes
of this License, Derivative Works shall not include works that remain
separable from, or merely link (or bind by name) to the interfaces of,
the Work and Derivative Works thereof.
"Contribution" shall mean any work of authorship, including
the original version of the Work and any modifications or additions
to that Work or Derivative Works thereof, that is intentionally
submitted to Licensor for inclusion in the Work by the copyright owner
or by an individual or Legal Entity authorized to submit on behalf of
the copyright owner. For the purposes of this definition, "submitted"
means any form of electronic, verbal, or written communication sent
to the Licensor or its representatives, including but not limited to
communication on electronic mailing lists, source code control systems,
and issue tracking systems that are managed by, or on behalf of, the
Licensor for the purpose of discussing and improving the Work, but
excluding communication that is conspicuously marked or otherwise
designated in writing by the copyright owner as "Not a Contribution."
"Contributor" shall mean Licensor and any individual or Legal Entity
on behalf of whom a Contribution has been received by Licensor and
subsequently incorporated within the Work.
2. Grant of Copyright License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
copyright license to reproduce, prepare Derivative Works of,
publicly display, publicly perform, sublicense, and distribute the
Work and such Derivative Works in Source or Object form.
3. Grant of Patent License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
(except as stated in this section) patent license to make, have made,
use, offer to sell, sell, import, and otherwise transfer the Work,
where such license applies only to those patent claims licensable
by such Contributor that are necessarily infringed by their
Contribution(s) alone or by combination of their Contribution(s)
with the Work to which such Contribution(s) was submitted. If You
institute patent litigation against any entity (including a
cross-claim or counterclaim in a lawsuit) alleging that the Work
or a Contribution incorporated within the Work constitutes direct
or contributory patent infringement, then any patent licenses
granted to You under this License for that Work shall terminate
as of the date such litigation is filed.
4. Redistribution. You may reproduce and distribute copies of the
Work or Derivative Works thereof in any medium, with or without
modifications, and in Source or Object form, provided that You
meet the following conditions:
(a) You must give any other recipients of the Work or
Derivative Works a copy of this License; and
(b) You must cause any modified files to carry prominent notices
stating that You changed the files; and
(c) You must retain, in the Source form of any Derivative Works
that You distribute, all copyright, patent, trademark, and
attribution notices from the Source form of the Work,
excluding those notices that do not pertain to any part of
the Derivative Works; and
(d) If the Work includes a "NOTICE" text file as part of its
distribution, then any Derivative Works that You distribute must
include a readable copy of the attribution notices contained
within such NOTICE file, excluding those notices that do not
pertain to any part of the Derivative Works, in at least one
of the following places: within a NOTICE text file distributed
as part of the Derivative Works; within the Source form or
documentation, if provided along with the Derivative Works; or,
within a display generated by the Derivative Works, if and
wherever such third-party notices normally appear. The contents
of the NOTICE file are for informational purposes only and
do not modify the License. You may add Your own attribution
notices within Derivative Works that You distribute, alongside
or as an addendum to the NOTICE text from the Work, provided
that such additional attribution notices cannot be construed
as modifying the License.
You may add Your own copyright statement to Your modifications and
may provide additional or different license terms and conditions
for use, reproduction, or distribution of Your modifications, or
for any such Derivative Works as a whole, provided Your use,
reproduction, and distribution of the Work otherwise complies with
the conditions stated in this License.
5. Submission of Contributions. Unless You explicitly state otherwise,
any Contribution intentionally submitted for inclusion in the Work
by You to the Licensor shall be under the terms and conditions of
this License, without any additional terms or conditions.
Notwithstanding the above, nothing herein shall supersede or modify
the terms of any separate license agreement you may have executed
with Licensor regarding such Contributions.
6. Trademarks. This License does not grant permission to use the trade
names, trademarks, service marks, or product names of the Licensor,
except as required for reasonable and customary use in describing the
origin of the Work and reproducing the content of the NOTICE file.
7. Disclaimer of Warranty. Unless required by applicable law or
agreed to in writing, Licensor provides the Work (and each
Contributor provides its Contributions) on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied, including, without limitation, any warranties or conditions
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
PARTICULAR PURPOSE. You are solely responsible for determining the
appropriateness of using or redistributing the Work and assume any
risks associated with Your exercise of permissions under this License.
8. Limitation of Liability. In no event and under no legal theory,
whether in tort (including negligence), contract, or otherwise,
unless required by applicable law (such as deliberate and grossly
negligent acts) or agreed to in writing, shall any Contributor be
liable to You for damages, including any direct, indirect, special,
incidental, or consequential damages of any character arising as a
result of this License or out of the use or inability to use the
Work (including but not limited to damages for loss of goodwill,
work stoppage, computer failure or malfunction, or any and all
other commercial damages or losses), even if such Contributor
has been advised of the possibility of such damages.
9. Accepting Warranty or Additional Liability. While redistributing
the Work or Derivative Works thereof, You may choose to offer,
and charge a fee for, acceptance of support, warranty, indemnity,
or other liability obligations and/or rights consistent with this
License. However, in accepting such obligations, You may act only
on Your own behalf and on Your sole responsibility, not on behalf
of any other Contributor, and only if You agree to indemnify,
defend, and hold each Contributor harmless for any liability
incurred by, or claims asserted against, such Contributor by reason
of your accepting any such warranty or additional liability.
END OF TERMS AND CONDITIONS
APPENDIX: How to apply the Apache License to your work.
Copyright 2026 ADD Ideas
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
==============================================================================
@add-ideas/toolbox-shell-react@0.2.3
Declared licence: Apache-2.0
==============================================================================
--- LICENSE ---
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
1. Definitions.
"License" shall mean the terms and conditions for use, reproduction,
and distribution as defined by Sections 1 through 9 of this document.
"Licensor" shall mean the copyright owner or entity authorized by
the copyright owner that is granting the License.
"Legal Entity" shall mean the union of the acting entity and all
other entities that control, are controlled by, or are under common
control with that entity. For the purposes of this definition,
"control" means (i) the power, direct or indirect, to cause the
direction or management of such entity, whether by contract or
otherwise, or (ii) ownership of fifty percent (50%) or more of the
outstanding shares, or (iii) beneficial ownership of such entity.
"You" (or "Your") shall mean an individual or Legal Entity
exercising permissions granted by this License.
"Source" form shall mean the preferred form for making modifications,
including but not limited to software source code, documentation
source, and configuration files.
"Object" form shall mean any form resulting from mechanical
transformation or translation of a Source form, including but
not limited to compiled object code, generated documentation,
and conversions to other media types.
"Work" shall mean the work of authorship, whether in Source or
Object form, made available under the License, as indicated by a
copyright notice that is included in or attached to the work
(an example is provided in the Appendix below).
"Derivative Works" shall mean any work, whether in Source or Object
form, that is based on (or derived from) the Work and for which the
editorial revisions, annotations, elaborations, or other modifications
represent, as a whole, an original work of authorship. For the purposes
of this License, Derivative Works shall not include works that remain
separable from, or merely link (or bind by name) to the interfaces of,
the Work and Derivative Works thereof.
"Contribution" shall mean any work of authorship, including
the original version of the Work and any modifications or additions
to that Work or Derivative Works thereof, that is intentionally
submitted to Licensor for inclusion in the Work by the copyright owner
or by an individual or Legal Entity authorized to submit on behalf of
the copyright owner. For the purposes of this definition, "submitted"
means any form of electronic, verbal, or written communication sent
to the Licensor or its representatives, including but not limited to
communication on electronic mailing lists, source code control systems,
and issue tracking systems that are managed by, or on behalf of, the
Licensor for the purpose of discussing and improving the Work, but
excluding communication that is conspicuously marked or otherwise
designated in writing by the copyright owner as "Not a Contribution."
"Contributor" shall mean Licensor and any individual or Legal Entity
on behalf of whom a Contribution has been received by Licensor and
subsequently incorporated within the Work.
2. Grant of Copyright License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
copyright license to reproduce, prepare Derivative Works of,
publicly display, publicly perform, sublicense, and distribute the
Work and such Derivative Works in Source or Object form.
3. Grant of Patent License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
(except as stated in this section) patent license to make, have made,
use, offer to sell, sell, import, and otherwise transfer the Work,
where such license applies only to those patent claims licensable
by such Contributor that are necessarily infringed by their
Contribution(s) alone or by combination of their Contribution(s)
with the Work to which such Contribution(s) was submitted. If You
institute patent litigation against any entity (including a
cross-claim or counterclaim in a lawsuit) alleging that the Work
or a Contribution incorporated within the Work constitutes direct
or contributory patent infringement, then any patent licenses
granted to You under this License for that Work shall terminate
as of the date such litigation is filed.
4. Redistribution. You may reproduce and distribute copies of the
Work or Derivative Works thereof in any medium, with or without
modifications, and in Source or Object form, provided that You
meet the following conditions:
(a) You must give any other recipients of the Work or
Derivative Works a copy of this License; and
(b) You must cause any modified files to carry prominent notices
stating that You changed the files; and
(c) You must retain, in the Source form of any Derivative Works
that You distribute, all copyright, patent, trademark, and
attribution notices from the Source form of the Work,
excluding those notices that do not pertain to any part of
the Derivative Works; and
(d) If the Work includes a "NOTICE" text file as part of its
distribution, then any Derivative Works that You distribute must
include a readable copy of the attribution notices contained
within such NOTICE file, excluding those notices that do not
pertain to any part of the Derivative Works, in at least one
of the following places: within a NOTICE text file distributed
as part of the Derivative Works; within the Source form or
documentation, if provided along with the Derivative Works; or,
within a display generated by the Derivative Works, if and
wherever such third-party notices normally appear. The contents
of the NOTICE file are for informational purposes only and
do not modify the License. You may add Your own attribution
notices within Derivative Works that You distribute, alongside
or as an addendum to the NOTICE text from the Work, provided
that such additional attribution notices cannot be construed
as modifying the License.
You may add Your own copyright statement to Your modifications and
may provide additional or different license terms and conditions
for use, reproduction, or distribution of Your modifications, or
for any such Derivative Works as a whole, provided Your use,
reproduction, and distribution of the Work otherwise complies with
the conditions stated in this License.
5. Submission of Contributions. Unless You explicitly state otherwise,
any Contribution intentionally submitted for inclusion in the Work
by You to the Licensor shall be under the terms and conditions of
this License, without any additional terms or conditions.
Notwithstanding the above, nothing herein shall supersede or modify
the terms of any separate license agreement you may have executed
with Licensor regarding such Contributions.
6. Trademarks. This License does not grant permission to use the trade
names, trademarks, service marks, or product names of the Licensor,
except as required for reasonable and customary use in describing the
origin of the Work and reproducing the content of the NOTICE file.
7. Disclaimer of Warranty. Unless required by applicable law or
agreed to in writing, Licensor provides the Work (and each
Contributor provides its Contributions) on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied, including, without limitation, any warranties or conditions
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
PARTICULAR PURPOSE. You are solely responsible for determining the
appropriateness of using or redistributing the Work and assume any
risks associated with Your exercise of permissions under this License.
8. Limitation of Liability. In no event and under no legal theory,
whether in tort (including negligence), contract, or otherwise,
unless required by applicable law (such as deliberate and grossly
negligent acts) or agreed to in writing, shall any Contributor be
liable to You for damages, including any direct, indirect, special,
incidental, or consequential damages of any character arising as a
result of this License or out of the use or inability to use the
Work (including but not limited to damages for loss of goodwill,
work stoppage, computer failure or malfunction, or any and all
other commercial damages or losses), even if such Contributor
has been advised of the possibility of such damages.
9. Accepting Warranty or Additional Liability. While redistributing
the Work or Derivative Works thereof, You may choose to offer,
and charge a fee for, acceptance of support, warranty, indemnity,
or other liability obligations and/or rights consistent with this
License. However, in accepting such obligations, You may act only
on Your own behalf and on Your sole responsibility, not on behalf
of any other Contributor, and only if You agree to indemnify,
defend, and hold each Contributor harmless for any liability
incurred by, or claims asserted against, such Contributor by reason
of your accepting any such warranty or additional liability.
END OF TERMS AND CONDITIONS
APPENDIX: How to apply the Apache License to your work.
Copyright 2026 ADD Ideas
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
==============================================================================
@zip.js/zip.js@2.9.0
Declared licence: BSD-3-Clause
==============================================================================
--- LICENSE ---
BSD 3-Clause License
Copyright (c) 2023, Gildas Lormeau
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
==============================================================================
fflate@0.8.3
Declared licence: MIT
==============================================================================
--- LICENSE ---
MIT License
Copyright (c) 2026 Arjun Barrett
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
==============================================================================
react@19.2.8
Declared licence: MIT
==============================================================================
--- LICENSE ---
MIT License
Copyright (c) Meta Platforms, Inc. and affiliates.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
==============================================================================
react-dom@19.2.8
Declared licence: MIT
==============================================================================
--- LICENSE ---
MIT License
Copyright (c) Meta Platforms, Inc. and affiliates.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
==============================================================================
scheduler@0.27.0
Declared licence: MIT
==============================================================================
--- LICENSE ---
MIT License
Copyright (c) Meta Platforms, Inc. and affiliates.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
public/README.md
+61
View File
@@ -0,0 +1,61 @@
# Archive Tools
Inspect, create, compare and safely extract archives locally.
Archive Tools is a standalone local-first application in the [add·ideas Toolbox](https://git.add-ideas.de/lotobo/toolbox-portal). Inputs are processed in the browser and are not uploaded.
## Version 0.1 scope
- Inspect ZIP and ZIP64 central directories, TAR/USTAR/PAX archives, gzip streams and tar.gz archives.
- List normalized paths, kinds, sizes, compression, timestamps, ZIP64 state, CRC-32 values and policy diagnostics.
- Preview bounded UTF-8 text, hexadecimal bytes and static JPEG/PNG/WebP images. HTML and SVG are shown as text, never rendered as active content.
- Select regular safe files, verify their bytes and CRC where available, and repackage them into a newly created ZIP. Archive paths are never restored directly to a filesystem.
- Create deterministic ZIP, TAR/PAX and tar.gz output from local files with sorted paths and normalized metadata.
- Compare two archive inventories by collision-safe path, entry kind, expanded size and CRC-32, independent of container format and timestamps.
- Download machine-readable inspection and comparison reports.
Encryption, split/multipart ZIPs, nested archive expansion, GNU TAR extensions, symlinks, hardlinks, devices and FIFOs are intentionally unsupported. Those entry kinds are either rejected or listed as blocked; they are never restored.
The application treats every imported file as untrusted, applies explicit count/path/expanded-byte/compression-ratio limits, and never executes imported active content. See [docs/ARCHITECTURE.md](docs/ARCHITECTURE.md) and [docs/PRIVACY-SECURITY.md](docs/PRIVACY-SECURITY.md).
## Safety limits
| Resource | Limit |
| -------------------------- | ------------------------------: |
| Source archive | 512 MiB |
| Entries inspected | 20,000 |
| Entries displayed at once | 5,000 |
| Expanded archive bytes | 512 MiB |
| One expanded entry | 256 MiB |
| Compression ratio | 200:1 |
| Path | 4,096 UTF-8 bytes / 64 segments |
| Creation | 5,000 files / 512 MiB |
| Text / hex / image preview | 2 MiB / 128 KiB / 24 MiB |
These are application-level ceilings, not a promise that every device can comfortably process files near the maximum.
## Using the workspaces
1. **Inspect & extract** opens one archive, displays its safety inventory and previews eligible files. Select safe regular files and choose **Verify & download safe ZIP** to create a fresh archive.
2. **Create** accepts local files and produces reproducible ZIP, TAR or tar.gz output. Browser file selection exposes relative paths only when the browser supplies them.
3. **Compare** opens two archives and reports same, changed, type-changed and one-sided entries.
## Development
Requires Node.js 22 and npm 11.
```sh
npm ci
npm run check
npm run test:browser
```
Runtime dependencies are exactly pinned. `npm audit` should be checked with every dependency update.
## Release
`npm run release:artifact` creates a deterministic `release/archive-tools-0.1.0.zip` and checksum sidecar.
## Licence
GPL-3.0-or-later. Runtime dependencies retain their own licences; see [THIRD_PARTY_NOTICES.md](THIRD_PARTY_NOTICES.md).
public/SECURITY.md
+3
View File
@@ -0,0 +1,3 @@
# Security
Please report vulnerabilities privately to the repository owner. Do not attach sensitive source files to public issues. Imported inputs are untrusted; parsers must remain bounded and must not execute active content or fetch external resources.
public/SOURCE.md
+7
View File
@@ -0,0 +1,7 @@
# Corresponding source
The corresponding source for Archive Tools 0.1.0 is available at:
https://git.add-ideas.de/lotobo/archive-tools/src/tag/v0.1.0
Build with Node.js 22, npm 11, `npm ci`, and `npm run release:artifact`.
public/THIRD_PARTY_NOTICES.md
+11
View File
@@ -0,0 +1,11 @@
# Third-party notices
Archive Tools is GPL-3.0-or-later. Its runtime dependencies retain their own licences:
- `@add-ideas/toolbox-contract` 0.2.3 — Apache-2.0
- `@add-ideas/toolbox-shell-react` 0.2.3 — Apache-2.0
- `@zip.js/zip.js` 2.9.0 — BSD-3-Clause
- `fflate` 0.8.3 — MIT
- `react` and `react-dom` 19.2.8 — MIT
Exact versions and integrity hashes are recorded in `package-lock.json`. Release artifacts generate a complete runtime dependency licence inventory at `LICENSES/npm-runtime-licenses.txt`.
public/docs/ACCESSIBILITY.md
+7
View File
@@ -0,0 +1,7 @@
# Accessibility
The workbench uses semantic landmarks, heading order, labelled native file/search/select controls and real tables with row/column headers. Workspace tabs expose their selected state. Every inventory checkbox includes the corresponding path in its accessible name; blocked controls are disabled rather than visually implied.
Status and parser errors use live `status` and `alert` roles. Safety and comparison states include text and do not rely on colour. Preview images receive entry-derived alternative text; textual and hexadecimal previews remain selectable and scrollable.
All actions are keyboard operable, focus is visible, dense tables scroll rather than clipping, and the layout collapses to one column at narrow widths. Theme selection comes from the shared Toolbox shell. Reduced-motion preferences disable non-essential motion.
public/docs/ARCHITECTURE.md
+28
View File
@@ -0,0 +1,28 @@
# Architecture
Archive Tools is a relocatable static React application. It has no backend, persistence, telemetry or runtime network dependency.
## Layers
- `src/archive/paths.ts` owns cross-platform path assessment and collision keys. It rejects traversal, absolute/drive/UNC paths, controls, ambiguous segments, Windows devices, alternate streams and excessive depth/length.
- `src/archive/zip.ts` uses exactly pinned `@zip.js/zip.js` for ZIP/ZIP64 inventory, CRC-checked reads and deterministic writing. Listing uses bounded entry iteration. Content reads request strict local/central-header agreement, CRC-32 validation and overlapping-entry checks.
- `src/archive/tar.ts` is a checked-offset TAR/USTAR/PAX reader and deterministic writer. Every header checksum is validated. PAX metadata is capped before UTF-8 decoding.
- `src/archive/gzip.ts` streams compressed input through fflate in small chunks, stops at the expanded-byte ceiling and independently checks the single-member CRC-32 and ISIZE footer. Concatenated members are unsupported.
- `src/archive/service.ts` detects formats, applies aggregate policies and exposes inspection, reading, safe repackaging, creation and reports.
- `src/archive/preview.ts` recognizes only bounded plain text, bytes and static raster images. Nested archives are never recursively expanded.
- `src/archive/compare.ts` compares normalized inventories without interpreting content.
- `src/components/workspaces` contains React views. Imported text is rendered through React text nodes; there is no `dangerouslySetInnerHTML`.
## Data flow
Inspection checks the source size and format before parsing. ZIP inventory reads only archive metadata. TAR and gzip inputs are held in memory only after the source ceiling is satisfied and gzip expansion is stopped at its output ceiling. TAR/gzip payloads remain in the current React document solely to support later previews and selection; replacing the document releases those references.
Preview and extraction never write source paths to the local filesystem. A selected entry is decoded into a bounded in-memory buffer, verified, and passed to a new deterministic ZIP writer using its already-assessed normalized path.
## Determinism
Creation sorts normalized paths by code-unit order. ZIP uses zip.js's bundled DEFLATE implementation at level 6 with native compression streams and workers disabled, fixed DOS dates, normalized regular-file modes, no extended timestamps and no data descriptors. TAR uses zero timestamps/IDs, regular mode `0644`, USTAR when possible and deterministic PAX path headers otherwise. gzip uses level 6 and mtime zero.
## Memory model
The parser refuses unsafe declared sizes before entry decompression. A bounded writable collects ZIP output and stops when actual output crosses the operation ceiling. gzip is pushed in 32 KiB source chunks and output is counted before retention. Creation and TAR parsing are deliberately capped because they currently use in-memory output/payloads.
public/docs/PRIVACY-SECURITY.md
+32
View File
@@ -0,0 +1,32 @@
# Privacy and security
## Privacy
Inputs remain in the browser. There is no telemetry, account, analytics, upload endpoint, persistence or runtime CDN. Object URLs exist only long enough to display or download local results and are revoked after use.
## Threat model
Archives are adversarial binary input. Relevant risks include traversal and alternate-stream names, normalization/case collisions, deceptive local versus central ZIP headers, overlapping ZIP entries, CRC corruption, compression bombs, integer overflow, excessive counts, malformed PAX lengths, active HTML/SVG, recursive nested archives and special filesystem entries.
Archive Tools responds as follows:
- source, count, expanded-byte, per-entry, ratio, path and preview budgets are fixed in `src/archive/limits.ts`;
- byte arithmetic uses checked safe integers and bounds before slicing;
- extraction never targets the filesystem: eligible content is verified and repackaged into a newly created ZIP;
- ZIP content reads enable CRC-32, strict local/central agreement and overlapping-entry checks;
- every TAR header checksum is verified, PAX metadata is bounded and GNU long-name extensions are refused;
- gzip output is counted during streaming and its CRC-32/ISIZE footer is independently verified;
- path collision keys are Unicode-normalized and conservative across case-insensitive platforms;
- symlinks, hardlinks, devices, FIFOs and unknown types are never restored;
- imported text is rendered as text, and HTML/SVG are not mounted as documents;
- raster images must pass byte/dimension/pixel/static checks before a browser decoder sees their Blob URL;
- nested archives are shown as bytes and never recursively opened;
- encrypted and multipart ZIP data is unsupported, with no password collection.
## Limits
The primary ceilings are 512 MiB source and aggregate expanded data, 256 MiB per entry, 20,000 entries and a 200:1 compression ratio. Preview limits are substantially smaller. Near-limit workloads may still be impractical on low-memory devices; the limits reduce risk but do not make untrusted archives inherently safe.
## Output meaning
“Safe file” means eligible for bounded verification and inclusion in a new ZIP under this policy. It is not a malware verdict. Archive Tools does not scan file semantics and does not make copied files trustworthy to open in another application.
public/favicon.svg
+1
View File
@@ -0,0 +1 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 64 64" role="img" aria-label="Archive Tools"><path fill="#5b4ec4" d="M11 4h30l12 12v44H11z"/><path fill="#fff" opacity=".28" d="M41 4v14h12"/><text x="32" y="43" fill="#fff" font-family="system-ui,sans-serif" font-size="18" font-weight="800" text-anchor="middle">AR</text></svg>
Side by Side

After

Width:  |  Height:  |  Size: 332 B

public/manifest.webmanifest
+18
View File
@@ -0,0 +1,18 @@
{
"name": "Archive Tools",
"short_name": "Archive",
"description": "Inspect, create, compare and safely extract archives locally.",
"start_url": "./",
"scope": "./",
"display": "standalone",
"background_color": "#f6f7fb",
"theme_color": "#29255f",
"icons": [
{
"src": "./favicon.svg",
"sizes": "any",
"type": "image/svg+xml",
"purpose": "any maskable"
}
]
}
public/sw.js
+54
View File
@@ -0,0 +1,54 @@
const CACHE_PREFIX = "archive-tools-shell-";
const CACHE_NAME = CACHE_PREFIX + "0.1.0";
const CORE = ["./", "./manifest.webmanifest", "./favicon.svg"];
self.addEventListener("install", (event) => {
event.waitUntil(
caches.open(CACHE_NAME).then(async (cache) => {
await cache.addAll(CORE);
const html = await (await fetch("./")).text();
const assets = [...html.matchAll(/(?:src|href)="(\.\/assets\/[^"]+)"/g)]
.map((match) => match[1])
.filter(Boolean);
await cache.addAll(assets);
}),
);
self.skipWaiting();
});
self.addEventListener("activate", (event) => {
event.waitUntil(
caches
.keys()
.then((keys) =>
Promise.all(
keys
.filter((key) => key.startsWith(CACHE_PREFIX) && key !== CACHE_NAME)
.map((key) => caches.delete(key)),
),
)
.then(() => self.clients.claim()),
);
});
self.addEventListener("fetch", (event) => {
if (event.request.method !== "GET") return;
const url = new URL(event.request.url);
if (
url.origin !== self.location.origin ||
!url.pathname.startsWith(new URL(self.registration.scope).pathname)
)
return;
event.respondWith(
caches.match(event.request).then(
(cached) =>
cached ??
fetch(event.request).then((response) => {
if (response.ok) {
const copy = response.clone();
void caches
.open(CACHE_NAME)
.then((cache) => cache.put(event.request, copy));
}
return response;
}),
),
);
});
public/toolbox-app.json
+41
View File
@@ -0,0 +1,41 @@
{
"$schema": "https://git.add-ideas.de/lotobo/toolbox-sdk/raw/branch/main/schemas/toolbox-app.v1.schema.json",
"schemaVersion": 1,
"id": "de.add-ideas.archive-tools",
"name": "Archive Tools",
"version": "0.1.0",
"description": "Inspect, create, compare and safely extract archives locally.",
"entry": "./",
"icon": "./favicon.svg",
"categories": ["files", "archives", "developer"],
"tags": ["zip", "tar", "gzip", "extract", "archive"],
"integration": {
"contextVersion": 1,
"launchModes": ["navigate", "new-tab"],
"embedding": "unsupported"
},
"requirements": {
"secureContext": false,
"workers": false,
"indexedDb": false,
"crossOriginIsolated": false,
"topLevelContext": false
},
"privacy": {
"processing": "local",
"fileUploads": false,
"telemetry": false,
"label": "Inputs stay in this browser; nothing is uploaded."
},
"source": {
"repository": "https://git.add-ideas.de/lotobo/archive-tools",
"license": "GPL-3.0-or-later"
},
"actions": [
{
"id": "source",
"label": "Source",
"url": "https://git.add-ideas.de/lotobo/archive-tools"
}
]
}
scripts/generate-toolbox-manifest.mjs
+33
View File
@@ -0,0 +1,33 @@
import { readFile, writeFile } from "node:fs/promises";
import path from "node:path";
import { fileURLToPath } from "node:url";
import { format } from "prettier";
const root = path.resolve(path.dirname(fileURLToPath(import.meta.url)), "..");
const sourcePath = path.join(root, "src/toolbox/manifest.source.json");
const outputPath = path.join(root, "public/toolbox-app.json");
const source = JSON.parse(await readFile(sourcePath, "utf8"));
const pkg = JSON.parse(await readFile(path.join(root, "package.json"), "utf8"));
const versionSource = await readFile(path.join(root, "src/version.ts"), "utf8");
const appVersion = /^export const APP_VERSION = "([^"]+)";$/mu.exec(
versionSource,
)?.[1];
const repository = "https://git.add-ideas.de/lotobo/" + pkg.name;
if (source.version !== pkg.version || appVersion !== pkg.version)
throw new Error("Version identity drift");
if (
source.id !== "de.add-ideas." + pkg.name ||
source.source?.repository !== repository ||
source.source?.license !== "GPL-3.0-or-later"
)
throw new Error("Manifest source identity is invalid");
const serialized = await format(JSON.stringify(source), {
filepath: outputPath,
});
if (process.argv.includes("--check")) {
if ((await readFile(outputPath, "utf8").catch(() => "")) !== serialized)
throw new Error("public/toolbox-app.json is stale");
console.log("Toolbox manifest is synchronized");
} else {
await writeFile(outputPath, serialized);
console.log("Generated public/toolbox-app.json");
}
scripts/package-release.mjs
+165
View File
@@ -0,0 +1,165 @@
#!/usr/bin/env node
import { createHash } from "node:crypto";
import { execFile } from "node:child_process";
import {
access,
chmod,
copyFile,
cp,
lstat,
mkdir,
mkdtemp,
readFile,
readdir,
rename,
rm,
utimes,
writeFile,
} from "node:fs/promises";
import os from "node:os";
import path from "node:path";
import { promisify } from "node:util";
import { fileURLToPath } from "node:url";
const execute = promisify(execFile);
const root = path.resolve(path.dirname(fileURLToPath(import.meta.url)), "..");
const pkg = JSON.parse(await readFile(path.join(root, "package.json"), "utf8"));
const argument = (name, fallback) => {
const index = process.argv.indexOf(name);
return index >= 0 ? process.argv[index + 1] : fallback;
};
const output = path.resolve(
root,
argument("--output", "release/" + pkg.name + "-" + pkg.version + ".zip"),
);
const checksumOutput = output + ".sha256";
const force = process.argv.includes("--force");
if (
path.extname(output).toLowerCase() !== ".zip" ||
output === root ||
output === path.parse(output).root
)
throw new Error("Unsafe release target");
const exists = (file) =>
access(file).then(
() => true,
() => false,
);
if (!force && ((await exists(output)) || (await exists(checksumOutput))))
throw new Error("Release output exists");
const input = path.join(root, "dist");
for (const name of [
"index.html",
"manifest.webmanifest",
"sw.js",
"toolbox-app.json",
"favicon.svg",
"README.md",
"CHANGELOG.md",
"CONTRIBUTING.md",
"LICENSE",
"SECURITY.md",
"SOURCE.md",
"THIRD_PARTY_NOTICES.md",
"LICENSES/README.md",
"LICENSES/npm-runtime-licenses.txt",
"docs/ACCESSIBILITY.md",
"docs/ARCHITECTURE.md",
"docs/PRIVACY-SECURITY.md",
]) {
const details = await lstat(path.join(input, name)).catch(() => null);
if (!details?.isFile() || details.isSymbolicLink())
throw new Error("Missing release file: " + name);
}
const manifest = JSON.parse(
await readFile(path.join(input, "toolbox-app.json"), "utf8"),
);
const repository = "https://git.add-ideas.de/lotobo/" + pkg.name;
if (
manifest.id !== "de.add-ideas." + pkg.name ||
manifest.version !== pkg.version ||
manifest.entry !== "./" ||
manifest.icon !== "./favicon.svg" ||
manifest.source?.repository !== repository
)
throw new Error("Packaged manifest identity is invalid");
if (
/\b(?:src|href)=["']\//iu.test(
await readFile(path.join(input, "index.html"), "utf8"),
)
)
throw new Error("Root-absolute asset reference");
async function collect(directory, prefix = "") {
const files = [];
for (const entry of (await readdir(directory, { withFileTypes: true })).sort(
(a, b) => a.name.localeCompare(b.name),
)) {
const absolute = path.join(directory, entry.name);
const relative = prefix ? prefix + "/" + entry.name : entry.name;
if (entry.isSymbolicLink())
throw new Error("Symlink in release: " + relative);
if (entry.isDirectory()) files.push(...(await collect(absolute, relative)));
else if (entry.isFile()) files.push({ absolute, relative });
else throw new Error("Unsupported release entry: " + relative);
}
return files;
}
const sourceFiles = await collect(input);
for (const file of sourceFiles)
if (
file.relative.endsWith(".map") ||
/(?:^|\/)(?:\.env(?:\.|$)|id_rsa|id_ed25519|.*\.pem$|.*\.key$)/iu.test(
file.relative,
) ||
file.relative.split("/").includes("..")
)
throw new Error("Forbidden release entry: " + file.relative);
await mkdir(path.dirname(output), { recursive: true });
const stagingRoot = await mkdtemp(
path.join(os.tmpdir(), pkg.name + "-release-"),
);
const publicationRoot = await mkdtemp(
path.join(path.dirname(output), "." + pkg.name + "-publish-"),
);
const stagedTree = path.join(stagingRoot, "tree");
const stagedArchive = path.join(stagingRoot, path.basename(output));
try {
await cp(input, stagedTree, { recursive: true });
const timestamp = new Date("1980-01-01T00:00:00.000Z");
for (const file of await collect(stagedTree)) {
await chmod(file.absolute, 0o644);
await utimes(file.absolute, timestamp, timestamp);
}
await execute(
"zip",
[
"-X",
"-q",
"-9",
stagedArchive,
...sourceFiles.map((file) => file.relative),
],
{
cwd: stagedTree,
env: { ...process.env, TZ: "UTC" },
maxBuffer: 1024 * 1024,
},
);
const archive = await readFile(stagedArchive);
const digest = createHash("sha256").update(archive).digest("hex");
const stagedChecksum = stagedArchive + ".sha256";
await writeFile(stagedChecksum, digest + " " + path.basename(output) + "\n");
const publicationArchive = path.join(publicationRoot, path.basename(output));
const publicationChecksum = publicationArchive + ".sha256";
await copyFile(stagedArchive, publicationArchive);
await copyFile(stagedChecksum, publicationChecksum);
if (force) {
await rm(output, { force: true });
await rm(checksumOutput, { force: true });
}
await rename(publicationArchive, output);
await rename(publicationChecksum, checksumOutput);
console.log("Created " + path.relative(root, output) + "\nSHA-256 " + digest);
} finally {
await rm(stagingRoot, { recursive: true, force: true });
await rm(publicationRoot, { recursive: true, force: true });
}
scripts/prepare-release-files.mjs
+70
View File
@@ -0,0 +1,70 @@
import { cp, mkdir, readFile, readdir, rm, writeFile } from "node:fs/promises";
import path from "node:path";
import { fileURLToPath } from "node:url";
const root = path.resolve(path.dirname(fileURLToPath(import.meta.url)), "..");
const destination = path.join(root, "public");
for (const name of [
"LICENSE",
"README.md",
"CHANGELOG.md",
"CONTRIBUTING.md",
"SECURITY.md",
"SOURCE.md",
"THIRD_PARTY_NOTICES.md",
]) {
await readFile(path.join(root, name));
await cp(path.join(root, name), path.join(destination, name));
}
for (const directory of ["LICENSES", "docs"]) {
const output = path.join(destination, directory);
await rm(output, { recursive: true, force: true });
await cp(path.join(root, directory), output, { recursive: true });
}
const lock = JSON.parse(
await readFile(path.join(root, "package-lock.json"), "utf8"),
);
const sections = [];
for (const [location, locked] of Object.entries(lock.packages ?? {}).sort(
([a], [b]) => a.localeCompare(b),
)) {
if (!location.includes("node_modules/") || locked.dev === true) continue;
const packageDirectory = path.join(root, location);
const details = JSON.parse(
await readFile(path.join(packageDirectory, "package.json"), "utf8"),
);
const candidates = (await readdir(packageDirectory))
.filter((name) => /^(?:licen[cs]e|copying|notice)(?:\.|$)/iu.test(name))
.sort();
const texts = [];
for (const candidate of candidates) {
try {
texts.push(
"--- " +
candidate +
" ---\n" +
(await readFile(path.join(packageDirectory, candidate), "utf8")),
);
} catch {
/* directory */
}
}
sections.push(
"=".repeat(78) +
"\n" +
details.name +
"@" +
details.version +
"\nDeclared licence: " +
(details.license ?? locked.license ?? "See upstream") +
"\n" +
"=".repeat(78) +
"\n" +
(texts.join("\n\n") || "See upstream package metadata."),
);
}
await mkdir(path.join(destination, "LICENSES"), { recursive: true });
await writeFile(
path.join(destination, "LICENSES/npm-runtime-licenses.txt"),
sections.join("\n\n").trimEnd() + "\n",
);
console.log("Prepared release documentation");
scripts/serve-test.mjs
+66
View File
@@ -0,0 +1,66 @@
import { createServer } from "node:http";
import { readFile, stat } from "node:fs/promises";
import path from "node:path";
import { fileURLToPath } from "node:url";
const root = path.resolve(
path.dirname(fileURLToPath(import.meta.url)),
"..",
"dist",
);
const prefix = "/deep/nested/archive/";
const types = new Map([
[".css", "text/css; charset=utf-8"],
[".html", "text/html; charset=utf-8"],
[".js", "text/javascript; charset=utf-8"],
[".json", "application/json; charset=utf-8"],
[".webmanifest", "application/manifest+json; charset=utf-8"],
[".svg", "image/svg+xml"],
[".md", "text/markdown; charset=utf-8"],
[".txt", "text/plain; charset=utf-8"],
[".wasm", "application/wasm"],
[".png", "image/png"],
[".jpg", "image/jpeg"],
[".webp", "image/webp"],
]);
const headers = {
"Content-Security-Policy":
"default-src 'self'; base-uri 'self'; object-src 'none'; frame-ancestors 'none'; form-action 'self'; script-src 'self' 'wasm-unsafe-eval'; style-src 'self' 'unsafe-inline'; img-src 'self' data: blob:; media-src 'self' blob:; connect-src 'self'; worker-src 'self' blob:; manifest-src 'self'",
"Cross-Origin-Opener-Policy": "same-origin",
"Cross-Origin-Resource-Policy": "same-origin",
"Permissions-Policy":
"camera=(), microphone=(), geolocation=(), usb=(), payment=()",
"Referrer-Policy": "no-referrer",
"X-Content-Type-Options": "nosniff",
};
const server = createServer(async (request, response) => {
try {
const url = new URL(request.url ?? "/", "http://127.0.0.1");
const relative = decodeURIComponent(url.pathname).startsWith(prefix)
? decodeURIComponent(url.pathname).slice(prefix.length)
: decodeURIComponent(url.pathname).replace(/^\/+/, "");
const normalized = path.posix.normalize(relative || "index.html");
if (
normalized === ".." ||
normalized.startsWith("../") ||
path.isAbsolute(normalized)
) {
response.writeHead(400).end("Bad request");
return;
}
let file = path.join(root, normalized);
if ((await stat(file).catch(() => null))?.isDirectory())
file = path.join(file, "index.html");
const content = await readFile(file);
response.writeHead(200, {
"Content-Type":
types.get(path.extname(file)) ?? "application/octet-stream",
"Cache-Control": "no-cache",
...headers,
});
response.end(content);
} catch {
response.writeHead(404, { "Content-Type": "text/plain; charset=utf-8" });
response.end("Not found");
}
});
server.listen(4173, "127.0.0.1", () => console.log("Test server ready"));
src/App.tsx
+35
View File
@@ -0,0 +1,35 @@
import { lazy, Suspense, useState } from "react";
import { AppShell } from "@add-ideas/toolbox-shell-react";
import "@add-ideas/toolbox-shell-react/styles.css";
import "./styles.css";
import { ErrorBoundary } from "./components/ErrorBoundary";
import { HelpDialog } from "./components/HelpDialog";
import { manifest } from "./toolbox/manifest";
const Workbench = lazy(async () => ({
default: (await import("./components/Workbench")).Workbench,
}));
export function App() {
const [helpOpen, setHelpOpen] = useState(false);
return (
<ErrorBoundary>
<AppShell
app={manifest}
manifestUrl="./toolbox-app.json"
helpAction={{ onClick: () => setHelpOpen(true) }}
>
<Suspense
fallback={
<p className="loading" role="status">
Preparing Archive Tools…
</p>
}
>
<Workbench />
</Suspense>
</AppShell>
<HelpDialog open={helpOpen} onClose={() => setHelpOpen(false)} />
</ErrorBoundary>
);
}
src/archive/checksums.ts
+25
View File
@@ -0,0 +1,25 @@
const table = (() => {
const values = new Uint32Array(256);
for (let index = 0; index < values.length; index += 1) {
let value = index;
for (let bit = 0; bit < 8; bit += 1)
value = value & 1 ? 0xedb88320 ^ (value >>> 1) : value >>> 1;
values[index] = value >>> 0;
}
return values;
})();
export function crc32(bytes: Uint8Array): number {
let value = 0xffffffff;
for (const byte of bytes)
value = table[(value ^ byte) & 0xff]! ^ (value >>> 8);
return (value ^ 0xffffffff) >>> 0;
}
export function crc32Hex(bytes: Uint8Array): string {
return crc32(bytes).toString(16).padStart(8, "0");
}
export function uint32Hex(value: number): string {
return (value >>> 0).toString(16).padStart(8, "0");
}
src/archive/compare.ts
+70
View File
@@ -0,0 +1,70 @@
import type {
ArchiveDocument,
ArchiveEntryRecord,
CompareRecord,
} from "./types";
export function compareArchives(
left: ArchiveDocument,
right: ArchiveDocument,
): CompareRecord[] {
const leftGroups = groupEntries(left.entries);
const rightGroups = groupEntries(right.entries);
const keys = new Set([...leftGroups.keys(), ...rightGroups.keys()]);
const rows: CompareRecord[] = [];
for (const key of [...keys].sort()) {
const leftEntries = leftGroups.get(key) ?? [];
const rightEntries = rightGroups.get(key) ?? [];
const length = Math.max(leftEntries.length, rightEntries.length);
for (let index = 0; index < length; index += 1) {
const leftEntry = leftEntries[index];
const rightEntry = rightEntries[index];
const path = leftEntry?.path ?? rightEntry?.path ?? key;
if (!leftEntry)
rows.push({ path, status: "only-right", right: rightEntry });
else if (!rightEntry)
rows.push({ path, status: "only-left", left: leftEntry });
else if (leftEntry.kind !== rightEntry.kind)
rows.push({
path,
status: "type-changed",
left: leftEntry,
right: rightEntry,
});
else
rows.push({
path,
status: sameEntry(leftEntry, rightEntry) ? "same" : "changed",
left: leftEntry,
right: rightEntry,
});
}
}
return rows;
}
function groupEntries(
entries: ArchiveEntryRecord[],
): Map<string, ArchiveEntryRecord[]> {
const groups = new Map<string, ArchiveEntryRecord[]>();
for (const entry of entries) {
const key = entry.collisionKey || entry.path;
const group = groups.get(key) ?? [];
group.push(entry);
groups.set(key, group);
}
return groups;
}
function sameEntry(
left: ArchiveEntryRecord,
right: ArchiveEntryRecord,
): boolean {
if (left.size !== right.size) return false;
if (left.kind === "directory") return true;
return (
left.crc32 !== undefined &&
right.crc32 !== undefined &&
left.crc32 === right.crc32
);
}
src/archive/downloads.ts
+31
View File
@@ -0,0 +1,31 @@
export function downloadBlob(blob: Blob, filename: string): void {
const url = URL.createObjectURL(blob);
try {
const anchor = document.createElement("a");
anchor.href = url;
anchor.download = safeFilename(filename);
anchor.rel = "noopener";
anchor.click();
} finally {
window.setTimeout(() => URL.revokeObjectURL(url), 0);
}
}
export function safeFilename(value: string): string {
const withoutControls = [...value]
.map((character) => {
const code = character.codePointAt(0)!;
return code <= 0x1f || code === 0x7f ? "_" : character;
})
.join("");
const cleaned = withoutControls
.normalize("NFC")
.replaceAll(/[/\\:*?"<>|]/gu, "_")
.replaceAll(/[ .]+$/gu, "")
.slice(0, 180);
return cleaned || "archive-output";
}
export function outputStem(name: string): string {
return name.replace(/\.(?:tar\.gz|tgz|zip|tar|gz)$/iu, "") || "archive";
}
src/archive/errors.ts
+13
View File
@@ -0,0 +1,13 @@
export class ArchivePolicyError extends Error {
readonly code: string;
constructor(code: string, message: string) {
super(message);
this.name = "ArchivePolicyError";
this.code = code;
}
}
export function errorMessage(error: unknown): string {
return error instanceof Error ? error.message : String(error);
}
src/archive/gzip.ts
+172
View File
@@ -0,0 +1,172 @@
import { Gunzip, gzipSync } from "fflate";
import { crc32 } from "./checksums";
import { ArchivePolicyError } from "./errors";
import { throwIfAborted } from "./limits";
export interface GzipHeader {
originalName?: string;
modifiedAt?: string;
}
export function parseGzipHeader(bytes: Uint8Array): GzipHeader {
if (
bytes.length < 18 ||
bytes[0] !== 0x1f ||
bytes[1] !== 0x8b ||
bytes[2] !== 8
) {
throw new ArchivePolicyError(
"INVALID_GZIP",
"The file is not a complete DEFLATE gzip stream.",
);
}
const flags = bytes[3]!;
if (flags & 0xe0)
throw new ArchivePolicyError(
"INVALID_GZIP",
"The gzip header uses reserved flags.",
);
let offset = 10;
if (flags & 4) {
if (offset + 2 > bytes.length)
throw new ArchivePolicyError(
"TRUNCATED_GZIP",
"The gzip extra field is truncated.",
);
const length = bytes[offset]! | (bytes[offset + 1]! << 8);
offset += 2 + length;
}
let originalName: string | undefined;
if (flags & 8) {
const end = findZero(bytes, offset);
originalName = decodeLatin1(bytes.subarray(offset, end));
offset = end + 1;
}
if (flags & 16) offset = findZero(bytes, offset) + 1;
if (flags & 2) offset += 2;
if (offset + 8 > bytes.length)
throw new ArchivePolicyError(
"TRUNCATED_GZIP",
"The gzip payload is truncated.",
);
const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);
const modifiedSeconds = view.getUint32(4, true);
return {
originalName,
modifiedAt: modifiedSeconds
? new Date(modifiedSeconds * 1000).toISOString()
: undefined,
};
}
export function gunzipBounded(
bytes: Uint8Array,
maxOutputBytes: number,
signal?: AbortSignal,
): Uint8Array {
throwIfAborted(signal);
parseGzipHeader(bytes);
const chunks: Uint8Array[] = [];
let total = 0;
let completed = false;
let callbackError: unknown;
const gunzip = new Gunzip((chunk, final) => {
try {
throwIfAborted(signal);
total += chunk.byteLength;
if (total > maxOutputBytes) {
throw new ArchivePolicyError(
"EXPANDED_LIMIT",
"gzip output exceeds the expanded-byte safety limit.",
);
}
chunks.push(chunk.slice());
completed = final;
} catch (error) {
callbackError = error;
throw error;
}
});
gunzip.onmember = () => {
callbackError = new ArchivePolicyError(
"MULTI_MEMBER_GZIP",
"Concatenated multi-member gzip streams are unsupported.",
);
throw callbackError;
};
const inputChunk = 32 * 1024;
try {
for (let offset = 0; offset < bytes.length; offset += inputChunk) {
throwIfAborted(signal);
gunzip.push(
bytes.subarray(offset, Math.min(offset + inputChunk, bytes.length)),
offset + inputChunk >= bytes.length,
);
}
} catch (error) {
throw callbackError ?? error;
}
if (!completed)
throw new ArchivePolicyError(
"TRUNCATED_GZIP",
"gzip stream did not finish cleanly.",
);
const output = concatenate(chunks, total);
const footer = new DataView(
bytes.buffer,
bytes.byteOffset + bytes.byteLength - 8,
8,
);
const expectedCrc = footer.getUint32(0, true);
const expectedSize = footer.getUint32(4, true);
if (
crc32(output) !== expectedCrc ||
output.byteLength >>> 0 !== expectedSize
) {
throw new ArchivePolicyError(
"GZIP_INTEGRITY",
"gzip CRC-32 or size footer does not match. Concatenated gzip members are intentionally unsupported.",
);
}
return output;
}
export function gzipDeterministic(bytes: Uint8Array): Uint8Array {
return gzipSync(bytes, { level: 6, mtime: 0 });
}
function findZero(bytes: Uint8Array, start: number): number {
for (let index = start; index < bytes.length; index += 1)
if (bytes[index] === 0) return index;
throw new ArchivePolicyError(
"TRUNCATED_GZIP",
"A zero-terminated gzip header field is truncated.",
);
}
function decodeLatin1(bytes: Uint8Array): string {
return [...new TextDecoder("windows-1252").decode(bytes)]
.map((character) => {
const code = character.codePointAt(0)!;
return character === "\\" ||
character === "/" ||
code <= 0x1f ||
code === 0x7f
? "_"
: character;
})
.join("");
}
function concatenate(chunks: Uint8Array[], size: number): Uint8Array {
const output = new Uint8Array(size);
let offset = 0;
for (const chunk of chunks) {
output.set(chunk, offset);
offset += chunk.byteLength;
}
return output;
}
src/archive/limits.ts
+59
View File
@@ -0,0 +1,59 @@
import { ArchivePolicyError } from "./errors";
export const ARCHIVE_LIMITS = Object.freeze({
maxSourceBytes: 512 * 1024 * 1024,
maxEntries: 20_000,
maxDisplayedEntries: 5_000,
maxExpandedBytes: 512 * 1024 * 1024,
maxEntryBytes: 256 * 1024 * 1024,
maxCompressionRatio: 200,
maxPathBytes: 4_096,
maxPathSegments: 64,
maxSegmentBytes: 255,
maxPreviewTextBytes: 2 * 1024 * 1024,
maxPreviewHexBytes: 128 * 1024,
maxPreviewImageBytes: 24 * 1024 * 1024,
maxPreviewImagePixels: 40_000_000,
maxPreviewImageEdge: 32_768,
maxCreateFiles: 5_000,
maxCreateBytes: 512 * 1024 * 1024,
maxPaxHeaderBytes: 1024 * 1024,
});
export function assertFiniteSafeInteger(value: number, label: string): void {
if (!Number.isSafeInteger(value) || value < 0) {
throw new ArchivePolicyError(
"INVALID_SIZE",
`${label} is not a safe non-negative byte count.`,
);
}
}
export function assertSourceSize(file: Blob): void {
if (file.size > ARCHIVE_LIMITS.maxSourceBytes) {
throw new ArchivePolicyError(
"SOURCE_TOO_LARGE",
`Archive exceeds the ${formatBytes(ARCHIVE_LIMITS.maxSourceBytes)} source limit.`,
);
}
}
export function formatBytes(bytes: number): string {
if (!Number.isFinite(bytes)) return "unknown";
const units = ["B", "KiB", "MiB", "GiB"];
let value = Math.max(0, bytes);
let unit = 0;
while (value >= 1024 && unit < units.length - 1) {
value /= 1024;
unit += 1;
}
return `${value >= 10 || unit === 0 ? value.toFixed(0) : value.toFixed(1)} ${units[unit]}`;
}
export function throwIfAborted(signal?: AbortSignal): void {
if (signal?.aborted) {
throw signal.reason instanceof Error
? signal.reason
: new DOMException("Operation cancelled.", "AbortError");
}
}
src/archive/paths.ts
+166
View File
@@ -0,0 +1,166 @@
import { ARCHIVE_LIMITS } from "./limits";
import type { ArchiveIssue } from "./types";
const WINDOWS_DEVICE = /^(?:con|prn|aux|nul|com[1-9]|lpt[1-9])(?:\.|$)/iu;
const DRIVE_PATH = /^[a-z]:/iu;
const BIDI_CONTROL = /[\u200e\u200f\u202a-\u202e\u2066-\u2069]/u;
const encoder = new TextEncoder();
export interface PathAssessment {
normalized: string;
collisionKey: string;
safe: boolean;
issues: ArchiveIssue[];
}
export function assessArchivePath(rawPath: string): PathAssessment {
const issues: ArchiveIssue[] = [];
const slashPath = rawPath.replaceAll("\\", "/");
const normalizedUnicode = slashPath.normalize("NFC");
const isDirectory = normalizedUnicode.endsWith("/");
const withoutTrailing = isDirectory
? normalizedUnicode.slice(0, -1)
: normalizedUnicode;
const rawSegments = withoutTrailing.split("/");
if (!rawPath || containsControlCharacter(rawPath)) {
issues.push(
issue(
"UNSAFE_CONTROL_PATH",
"Path is empty or contains control characters.",
),
);
}
if (BIDI_CONTROL.test(rawPath)) {
issues.push(
issue(
"DANGEROUS_UNICODE_PATH",
"Bidirectional display-control characters are blocked in archive paths.",
),
);
}
if (rawPath.includes("\\")) {
issues.push(
issue(
"BACKSLASH_PATH",
"Backslashes are ambiguous across archive tools and operating systems.",
),
);
}
if (
normalizedUnicode.startsWith("/") ||
normalizedUnicode.startsWith("//") ||
DRIVE_PATH.test(normalizedUnicode)
) {
issues.push(
issue(
"ABSOLUTE_PATH",
"Absolute, drive-letter and UNC paths are blocked.",
),
);
}
if (rawSegments.some((segment) => segment === "..")) {
issues.push(
issue("PATH_TRAVERSAL", "Parent-directory path segments are blocked."),
);
}
if (rawSegments.some((segment) => segment === "." || segment === "")) {
issues.push(
issue(
"AMBIGUOUS_PATH",
"Empty and current-directory path segments are blocked.",
),
);
}
if (rawSegments.length > ARCHIVE_LIMITS.maxPathSegments) {
issues.push(
issue(
"PATH_TOO_DEEP",
`Path has more than ${ARCHIVE_LIMITS.maxPathSegments} segments.`,
),
);
}
if (
encoder.encode(normalizedUnicode).byteLength > ARCHIVE_LIMITS.maxPathBytes
) {
issues.push(
issue(
"PATH_TOO_LONG",
`Path exceeds ${ARCHIVE_LIMITS.maxPathBytes} UTF-8 bytes.`,
),
);
}
for (const segment of rawSegments) {
if (encoder.encode(segment).byteLength > ARCHIVE_LIMITS.maxSegmentBytes) {
issues.push(
issue("SEGMENT_TOO_LONG", "A path segment exceeds 255 UTF-8 bytes."),
);
break;
}
if (segment.endsWith(".") || segment.endsWith(" ")) {
issues.push(
issue(
"WINDOWS_PATH_COLLISION",
"Trailing dots or spaces are unsafe on Windows filesystems.",
),
);
break;
}
if (segment.includes(":")) {
issues.push(
issue(
"ALTERNATE_STREAM_PATH",
"Colon-containing path segments are blocked.",
),
);
break;
}
if (WINDOWS_DEVICE.test(segment)) {
issues.push(
issue(
"WINDOWS_DEVICE_PATH",
"Reserved Windows device names are blocked.",
),
);
break;
}
}
const cleanedSegments = rawSegments.filter(
(segment) => segment && segment !== "." && segment !== "..",
);
const normalized = `${cleanedSegments.join("/")}${isDirectory && cleanedSegments.length ? "/" : ""}`;
const collisionKey = cleanedSegments
.map((segment) =>
segment.replace(/[ .]+$/gu, "").toLocaleLowerCase("en-US"),
)
.join("/");
return {
normalized,
collisionKey,
safe: issues.every((candidate) => candidate.severity !== "error"),
issues,
};
}
export function creationPath(file: File): string {
const relative = "webkitRelativePath" in file ? file.webkitRelativePath : "";
return relative || file.name;
}
function issue(code: string, message: string): ArchiveIssue {
return {
code,
message,
severity: code === "BACKSLASH_PATH" ? "warning" : "error",
};
}
function containsControlCharacter(value: string): boolean {
return [...value].some((character) => {
const code = character.codePointAt(0)!;
return code <= 0x1f || code === 0x7f;
});
}
src/archive/preview.ts
+304
View File
@@ -0,0 +1,304 @@
import { ArchivePolicyError } from "./errors";
import { ARCHIVE_LIMITS } from "./limits";
import { readEntryBytes } from "./service";
import type {
ArchiveDocument,
ArchiveEntryRecord,
PreviewResult,
} from "./types";
const textExtensions = new Set([
"txt",
"md",
"markdown",
"json",
"jsonl",
"csv",
"tsv",
"xml",
"html",
"htm",
"css",
"js",
"mjs",
"cjs",
"ts",
"tsx",
"jsx",
"yml",
"yaml",
"toml",
"ini",
"conf",
"log",
"svg",
"sql",
"sh",
]);
export async function previewEntry(
document: ArchiveDocument,
entry: ArchiveEntryRecord,
signal?: AbortSignal,
): Promise<PreviewResult> {
if (entry.kind !== "file")
throw new ArchivePolicyError(
"NOT_A_FILE",
"Only regular files can be previewed.",
);
if (entry.size > ARCHIVE_LIMITS.maxPreviewImageBytes) {
throw new ArchivePolicyError(
"PREVIEW_LIMIT",
"Entry is too large for an in-memory preview.",
);
}
const bytes = await readEntryBytes(
document,
entry,
ARCHIVE_LIMITS.maxPreviewImageBytes,
signal,
);
const nested = isArchive(bytes, entry.path);
if (nested) {
return {
kind: "hex",
text: formatHex(bytes.subarray(0, ARCHIVE_LIMITS.maxPreviewHexBytes)),
truncated: bytes.length > ARCHIVE_LIMITS.maxPreviewHexBytes,
note: "Nested archive expansion is intentionally unsupported; showing bytes only.",
};
}
const image = inspectImage(bytes);
if (image) {
if (image.animated)
throw new ArchivePolicyError(
"ANIMATED_PREVIEW",
"Animated image previews are disabled.",
);
if (
image.width > ARCHIVE_LIMITS.maxPreviewImageEdge ||
image.height > ARCHIVE_LIMITS.maxPreviewImageEdge ||
image.width * image.height > ARCHIVE_LIMITS.maxPreviewImagePixels
) {
throw new ArchivePolicyError(
"IMAGE_PREVIEW_LIMIT",
"Image dimensions exceed the preview decode budget.",
);
}
return {
kind: "image",
blob: new Blob([ownedBuffer(bytes)], { type: image.mimeType }),
...image,
};
}
const extension =
entry.path.split(".").at(-1)?.toLocaleLowerCase("en-US") ?? "";
if (
bytes.byteLength <= ARCHIVE_LIMITS.maxPreviewTextBytes &&
(textExtensions.has(extension) || looksTextual(bytes))
) {
try {
return {
kind: "text",
text: new TextDecoder("utf-8", { fatal: true }).decode(bytes),
truncated: false,
};
} catch {
// Invalid UTF-8 is shown as bytes, never replacement text that could obscure content.
}
}
return {
kind: "hex",
text: formatHex(bytes.subarray(0, ARCHIVE_LIMITS.maxPreviewHexBytes)),
truncated: bytes.length > ARCHIVE_LIMITS.maxPreviewHexBytes,
};
}
function isArchive(bytes: Uint8Array, path: string): boolean {
if (bytes[0] === 0x50 && bytes[1] === 0x4b) return true;
if (bytes[0] === 0x1f && bytes[1] === 0x8b) return true;
return /\.(?:zip|tar|tgz|gz|7z|rar)$/iu.test(path);
}
function looksTextual(bytes: Uint8Array): boolean {
if (!bytes.length) return true;
const sample = bytes.subarray(0, Math.min(bytes.length, 4096));
let controls = 0;
for (const byte of sample) {
if (byte === 0) return false;
if (byte < 0x09 || (byte > 0x0d && byte < 0x20) || byte === 0x7f)
controls += 1;
}
return controls / sample.length < 0.01;
}
function formatHex(bytes: Uint8Array): string {
const rows: string[] = [];
for (let offset = 0; offset < bytes.length; offset += 16) {
const row = bytes.subarray(offset, offset + 16);
const hex = [...row]
.map((byte) => byte.toString(16).padStart(2, "0"))
.join(" ")
.padEnd(47, " ");
const ascii = [...row]
.map((byte) =>
byte >= 0x20 && byte <= 0x7e ? String.fromCharCode(byte) : ".",
)
.join("");
rows.push(`${offset.toString(16).padStart(8, "0")} ${hex} |${ascii}|`);
}
return rows.join("\n");
}
function inspectImage(
bytes: Uint8Array,
):
| { mimeType: string; width: number; height: number; animated?: boolean }
| undefined {
const png = pngDimensions(bytes);
if (png) return { mimeType: "image/png", ...png };
if (bytes[0] === 0xff && bytes[1] === 0xd8) {
const dimensions = jpegDimensions(bytes);
if (dimensions) return { mimeType: "image/jpeg", ...dimensions };
}
const webp = webpDimensions(bytes);
if (webp) return { mimeType: "image/webp", ...webp };
return undefined;
}
function pngDimensions(
bytes: Uint8Array,
): { width: number; height: number; animated: boolean } | undefined {
const signature = [0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a];
if (
bytes.length < 33 ||
signature.some((value, index) => bytes[index] !== value)
)
return undefined;
const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);
let offset = 8;
let width = 0;
let height = 0;
let animated = false;
while (offset + 12 <= bytes.length) {
const length = view.getUint32(offset);
const end = offset + 12 + length;
if (!Number.isSafeInteger(end) || end > bytes.length) return undefined;
const type = ascii(bytes, offset + 4, 4);
if (offset === 8 && (type !== "IHDR" || length !== 13)) return undefined;
if (type === "IHDR") {
width = view.getUint32(offset + 8);
height = view.getUint32(offset + 12);
} else if (type === "acTL") animated = true;
offset = end;
if (type === "IEND") break;
}
return width && height ? { width, height, animated } : undefined;
}
function webpDimensions(
bytes: Uint8Array,
): { width: number; height: number; animated: boolean } | undefined {
if (
bytes.length < 20 ||
ascii(bytes, 0, 4) !== "RIFF" ||
ascii(bytes, 8, 4) !== "WEBP" ||
read32le(bytes, 4) + 8 > bytes.length
)
return undefined;
let offset = 12;
let width = 0;
let height = 0;
let animated = false;
while (offset + 8 <= bytes.length) {
const type = ascii(bytes, offset, 4);
const size = read32le(bytes, offset + 4);
const data = offset + 8;
const end = data + size;
if (!Number.isSafeInteger(end) || end > bytes.length) return undefined;
if (type === "VP8X" && size >= 10) {
animated ||= Boolean(bytes[data]! & 0x02);
width = read24le(bytes, data + 4) + 1;
height = read24le(bytes, data + 7) + 1;
} else if (
type === "VP8 " &&
size >= 10 &&
bytes[data + 3] === 0x9d &&
bytes[data + 4] === 0x01 &&
bytes[data + 5] === 0x2a
) {
width ||= (bytes[data + 6]! | (bytes[data + 7]! << 8)) & 0x3fff;
height ||= (bytes[data + 8]! | (bytes[data + 9]! << 8)) & 0x3fff;
} else if (type === "VP8L" && size >= 5 && bytes[data] === 0x2f) {
width ||= 1 + (bytes[data + 1]! | ((bytes[data + 2]! & 0x3f) << 8));
height ||=
1 +
((bytes[data + 2]! >> 6) |
(bytes[data + 3]! << 2) |
((bytes[data + 4]! & 0x0f) << 10));
} else if (type === "ANIM" || type === "ANMF") animated = true;
offset = end + (size & 1);
}
return width && height ? { width, height, animated } : undefined;
}
function jpegDimensions(
bytes: Uint8Array,
): { width: number; height: number } | undefined {
let offset = 2;
while (offset + 9 < bytes.length) {
if (bytes[offset] !== 0xff) {
offset += 1;
continue;
}
const marker = bytes[offset + 1]!;
if (marker === 0xda || marker === 0xd9) return undefined;
if (
marker === 0x00 ||
marker === 0xff ||
(marker >= 0xd0 && marker <= 0xd7)
) {
offset += 2;
continue;
}
const length = (bytes[offset + 2]! << 8) | bytes[offset + 3]!;
if (length < 2 || offset + 2 + length > bytes.length) return undefined;
if (
[
0xc0, 0xc1, 0xc2, 0xc3, 0xc5, 0xc6, 0xc7, 0xc9, 0xca, 0xcb, 0xcd, 0xce,
0xcf,
].includes(marker)
) {
return {
height: (bytes[offset + 5]! << 8) | bytes[offset + 6]!,
width: (bytes[offset + 7]! << 8) | bytes[offset + 8]!,
};
}
offset += 2 + length;
}
return undefined;
}
function ascii(bytes: Uint8Array, offset: number, length: number): string {
return String.fromCharCode(...bytes.subarray(offset, offset + length));
}
function read32le(bytes: Uint8Array, offset: number): number {
return new DataView(bytes.buffer, bytes.byteOffset + offset, 4).getUint32(
0,
true,
);
}
function read24le(bytes: Uint8Array, offset: number): number {
return (
bytes[offset]! | (bytes[offset + 1]! << 8) | (bytes[offset + 2]! << 16)
);
}
function ownedBuffer(bytes: Uint8Array): ArrayBuffer {
const copy = new Uint8Array(bytes.byteLength);
copy.set(bytes);
return copy.buffer;
}
src/archive/service.ts
+389
View File
@@ -0,0 +1,389 @@
import { ArchivePolicyError } from "./errors";
import { crc32Hex } from "./checksums";
import { gunzipBounded, gzipDeterministic, parseGzipHeader } from "./gzip";
import { ARCHIVE_LIMITS, assertSourceSize, throwIfAborted } from "./limits";
import { assessArchivePath, creationPath } from "./paths";
import { createTar, looksLikeTar, parseTar } from "./tar";
import type {
ArchiveDocument,
ArchiveEntryRecord,
ArchiveFormat,
ArchiveSummary,
CreateFormat,
CreateInput,
ProgressUpdate,
} from "./types";
import { createZip, parseZip, readZipEntries } from "./zip";
export async function inspectArchive(
file: File,
signal?: AbortSignal,
): Promise<ArchiveDocument> {
assertSourceSize(file);
throwIfAborted(signal);
const probe = new Uint8Array(await file.slice(0, 512).arrayBuffer());
const format = detectArchiveFormat(file.name, probe);
if (format === "zip") {
const parsed = await parseZip(file, signal);
return {
name: file.name,
format,
source: file,
sourceBytes: file.size,
entries: parsed.entries,
issues: parsed.issues,
expandedBytes: parsed.expandedBytes,
compressedBytes: parsed.compressedBytes,
zip64: parsed.zip64,
};
}
const source = new Uint8Array(await file.arrayBuffer());
throwIfAborted(signal);
const payload =
format === "gzip" || format === "tar.gz"
? gunzipBounded(
source,
Math.min(
ARCHIVE_LIMITS.maxExpandedBytes,
file.size * ARCHIVE_LIMITS.maxCompressionRatio,
),
signal,
)
: source;
if (
(format === "gzip" || format === "tar.gz") &&
payload.byteLength / Math.max(1, file.size) >
ARCHIVE_LIMITS.maxCompressionRatio
) {
throw new ArchivePolicyError(
"COMPRESSION_RATIO",
`gzip expansion exceeds the ${ARCHIVE_LIMITS.maxCompressionRatio}:1 compression-ratio policy.`,
);
}
if (format === "tar" || looksLikeTar(payload)) {
const parsed = parseTar(payload, signal);
return {
name: file.name,
format: format === "tar" ? "tar" : "tar.gz",
source: file,
sourceBytes: file.size,
entries: parsed.entries,
issues: parsed.issues,
expandedBytes: parsed.expandedBytes,
compressedBytes: format === "tar" ? parsed.expandedBytes : file.size,
zip64: false,
payload,
};
}
const header = parseGzipHeader(source);
const rawPath =
header.originalName || file.name.replace(/\.gz$/iu, "") || "payload";
const path = assessArchivePath(rawPath);
const entryIssues = path.issues.map((issue) => ({ ...issue, entryId: "0" }));
if (payload.byteLength > ARCHIVE_LIMITS.maxEntryBytes) {
entryIssues.push({
code: "ENTRY_TOO_LARGE",
message: "gzip payload exceeds the per-entry expanded-byte limit.",
severity: "error",
entryId: "0",
});
}
const entry: ArchiveEntryRecord = {
id: "0",
sourceIndex: 0,
rawPath,
path: path.normalized || rawPath,
collisionKey: path.collisionKey,
kind: "file",
size: payload.byteLength,
compressedSize: file.size,
modifiedAt: header.modifiedAt,
crc32: crc32Hex(payload),
compression: "deflate",
extractable: entryIssues.every((issue) => issue.severity !== "error"),
issues: entryIssues,
dataOffset: 0,
};
return {
name: file.name,
format: "gzip",
source: file,
sourceBytes: file.size,
entries: [entry],
issues: [],
expandedBytes: payload.byteLength,
compressedBytes: file.size,
zip64: false,
payload,
};
}
export async function readEntryBytes(
document: ArchiveDocument,
entry: ArchiveEntryRecord,
maxBytes: number,
signal?: AbortSignal,
): Promise<Uint8Array> {
if (!entry.extractable)
throw new ArchivePolicyError(
"BLOCKED_ENTRY",
"This entry is blocked by the archive safety policy.",
);
if (entry.size > maxBytes)
throw new ArchivePolicyError(
"ENTRY_TOO_LARGE",
"Entry exceeds this operation's byte limit.",
);
if (document.format === "zip") {
return (
await readZipEntries(
document.source,
[entry.sourceIndex],
maxBytes,
signal,
)
).get(entry.sourceIndex)!;
}
throwIfAborted(signal);
if (!document.payload || entry.dataOffset === undefined) {
throw new ArchivePolicyError(
"MISSING_PAYLOAD",
"Archive payload is no longer available.",
);
}
const end = entry.dataOffset + entry.size;
if (!Number.isSafeInteger(end) || end > document.payload.byteLength) {
throw new ArchivePolicyError(
"TRUNCATED_ENTRY",
"Entry points outside the bounded archive payload.",
);
}
return document.payload.slice(entry.dataOffset, end);
}
export async function createSafeSelectionZip(
document: ArchiveDocument,
entryIds: string[],
signal?: AbortSignal,
onProgress?: (update: ProgressUpdate) => void,
): Promise<Blob> {
const selected = entryIds.map((id) =>
document.entries.find((entry) => entry.id === id),
);
if (selected.some((entry) => !entry))
throw new ArchivePolicyError(
"MISSING_ENTRY",
"A selected entry no longer exists.",
);
const entries = (selected as ArchiveEntryRecord[]).sort((left, right) =>
left.path < right.path ? -1 : left.path > right.path ? 1 : 0,
);
if (!entries.length)
throw new ArchivePolicyError(
"EMPTY_SELECTION",
"Select at least one regular safe file.",
);
if (entries.some((entry) => !entry.extractable || entry.kind !== "file")) {
throw new ArchivePolicyError(
"BLOCKED_ENTRY",
"The selection contains a blocked or non-file entry.",
);
}
const expanded = entries.reduce((sum, entry) => sum + entry.size, 0);
if (expanded > ARCHIVE_LIMITS.maxExpandedBytes) {
throw new ArchivePolicyError(
"EXPANDED_LIMIT",
"Selected files exceed the aggregate expanded-byte limit.",
);
}
let zipBytes: Map<number, Uint8Array> | undefined;
if (document.format === "zip") {
zipBytes = await readZipEntries(
document.source,
entries.map((entry) => entry.sourceIndex),
ARCHIVE_LIMITS.maxEntryBytes,
signal,
);
}
const inputs: CreateInput[] = [];
for (const [index, entry] of entries.entries()) {
throwIfAborted(signal);
const bytes =
zipBytes?.get(entry.sourceIndex) ??
(await readEntryBytes(
document,
entry,
ARCHIVE_LIMITS.maxEntryBytes,
signal,
));
inputs.push({
path: entry.path,
file: new File([ownedBuffer(bytes)], leafName(entry.path), {
type: "application/octet-stream",
}),
});
onProgress?.({
stage: "Verifying selection",
completed: index + 1,
total: entries.length,
});
}
return createZip(inputs, signal, onProgress);
}
export async function createArchive(
files: File[],
format: CreateFormat,
signal?: AbortSignal,
onProgress?: (update: ProgressUpdate) => void,
): Promise<Blob> {
const inputs = validateCreationInputs(files);
if (format === "zip") return createZip(inputs, signal, onProgress);
const tar = await createTar(inputs, signal, onProgress);
if (format === "tar")
return new Blob([ownedBuffer(tar)], { type: "application/x-tar" });
throwIfAborted(signal);
return new Blob([ownedBuffer(gzipDeterministic(tar))], {
type: "application/gzip",
});
}
export function validateCreationInputs(files: File[]): CreateInput[] {
if (!files.length)
throw new ArchivePolicyError(
"EMPTY_INPUT",
"Choose at least one file to create an archive.",
);
if (files.length > ARCHIVE_LIMITS.maxCreateFiles) {
throw new ArchivePolicyError(
"CREATE_COUNT",
`Creation is limited to ${ARCHIVE_LIMITS.maxCreateFiles} files.`,
);
}
let total = 0;
for (const file of files) {
if (!Number.isSafeInteger(file.size) || file.size < 0)
throw new ArchivePolicyError(
"INVALID_SIZE",
`${file.name} has an invalid byte size.`,
);
total += file.size;
if (!Number.isSafeInteger(total))
throw new ArchivePolicyError(
"CREATE_LIMIT",
"Selected file sizes exceed safe integer arithmetic.",
);
}
if (total > ARCHIVE_LIMITS.maxCreateBytes) {
throw new ArchivePolicyError(
"CREATE_LIMIT",
"Selected files exceed the creation byte limit.",
);
}
const collisions = new Set<string>();
const inputs = files.map((file) => {
const assessed = assessArchivePath(creationPath(file));
if (!assessed.safe || !assessed.normalized) {
throw new ArchivePolicyError(
"UNSAFE_CREATE_PATH",
`${file.name} has an unsafe or ambiguous archive path.`,
);
}
if (collisions.has(assessed.collisionKey)) {
throw new ArchivePolicyError(
"DUPLICATE_PATH",
`${assessed.normalized} collides with another selected path.`,
);
}
collisions.add(assessed.collisionKey);
return { path: assessed.normalized, file };
});
return inputs.sort((left, right) =>
left.path < right.path ? -1 : left.path > right.path ? 1 : 0,
);
}
export function archiveSummary(document: ArchiveDocument): ArchiveSummary {
const entryIssues = document.entries.flatMap((entry) => entry.issues);
return {
name: document.name,
format: document.format,
sourceBytes: document.sourceBytes,
entries: document.entries.length,
files: document.entries.filter((entry) => entry.kind === "file").length,
directories: document.entries.filter((entry) => entry.kind === "directory")
.length,
blocked: document.entries.filter(
(entry) => !entry.extractable && entry.kind !== "directory",
).length,
expandedBytes: document.expandedBytes,
compressedBytes: document.compressedBytes,
zip64: document.zip64,
issues: [...document.issues, ...entryIssues],
};
}
export function reportJson(document: ArchiveDocument): string {
const report = {
schema: "de.add-ideas.archive-tools.report.v1",
generatedAt: new Date().toISOString(),
summary: archiveSummary(document),
policy: {
...ARCHIVE_LIMITS,
encryption: "unsupported",
multipartZip: "unsupported",
nestedExpansion: "unsupported",
specialEntries: "listed but never restored",
zipIntegrity:
"CRC-32 and strict local/central header agreement are verified when content is read",
tarIntegrity: "every header checksum is verified",
gzipIntegrity: "CRC-32 and ISIZE are verified",
},
entries: document.entries.map((entry) => {
const reportEntry = { ...entry };
delete reportEntry.dataOffset;
return reportEntry;
}),
};
return `${JSON.stringify(report, null, 2)}\n`;
}
export function detectArchiveFormat(
name: string,
probe: Uint8Array,
): ArchiveFormat {
if (
probe[0] === 0x50 &&
probe[1] === 0x4b &&
[0x03, 0x05, 0x07].includes(probe[2] ?? -1)
)
return "zip";
if (probe[0] === 0x1f && probe[1] === 0x8b)
return /\.t(?:ar\.)?gz$|\.tgz$/iu.test(name) ? "tar.gz" : "gzip";
if (looksLikeTar(probe) || /\.tar$/iu.test(name)) return "tar";
if (/\.(?:rar|7z|bz2|xz|zst|lz4)$/iu.test(name)) {
throw new ArchivePolicyError(
"UNSUPPORTED_FORMAT",
"This release supports ZIP/ZIP64, TAR/USTAR/PAX and gzip/tar.gz only.",
);
}
throw new ArchivePolicyError(
"UNKNOWN_FORMAT",
"The file does not have a supported archive signature.",
);
}
function leafName(path: string): string {
return path.split("/").filter(Boolean).at(-1) || "file";
}
function ownedBuffer(bytes: Uint8Array): ArrayBuffer {
const copy = new Uint8Array(bytes.byteLength);
copy.set(bytes);
return copy.buffer;
}
src/archive/tar.ts
+560
View File
@@ -0,0 +1,560 @@
import { crc32Hex } from "./checksums";
import { ArchivePolicyError } from "./errors";
import {
ARCHIVE_LIMITS,
assertFiniteSafeInteger,
throwIfAborted,
} from "./limits";
import { assessArchivePath } from "./paths";
import type {
ArchiveEntryKind,
ArchiveEntryRecord,
ArchiveIssue,
CreateInput,
ProgressUpdate,
} from "./types";
const BLOCK_SIZE = 512;
const encoder = new TextEncoder();
const decoder = new TextDecoder("utf-8", { fatal: true });
export interface ParsedTar {
entries: ArchiveEntryRecord[];
issues: ArchiveIssue[];
expandedBytes: number;
}
export function looksLikeTar(bytes: Uint8Array): boolean {
if (bytes.byteLength < BLOCK_SIZE) return false;
if (isZeroBlock(bytes.subarray(0, BLOCK_SIZE))) return true;
try {
return (
storedChecksum(bytes.subarray(0, BLOCK_SIZE)) ===
calculateHeaderChecksum(bytes.subarray(0, BLOCK_SIZE))
);
} catch {
return false;
}
}
export function parseTar(bytes: Uint8Array, signal?: AbortSignal): ParsedTar {
const entries: ArchiveEntryRecord[] = [];
const issues: ArchiveIssue[] = [];
const collisions = new Map<string, string>();
let offset = 0;
let zeroBlocks = 0;
let expandedBytes = 0;
let pendingPax: Record<string, string> | undefined;
let globalPax: Record<string, string> = {};
while (offset + BLOCK_SIZE <= bytes.byteLength) {
throwIfAborted(signal);
const header = bytes.subarray(offset, offset + BLOCK_SIZE);
if (isZeroBlock(header)) {
zeroBlocks += 1;
offset += BLOCK_SIZE;
if (zeroBlocks === 2) break;
continue;
}
if (zeroBlocks)
throw new ArchivePolicyError(
"INVALID_TAR_END",
"A non-zero block follows the TAR end marker.",
);
if (storedChecksum(header) !== calculateHeaderChecksum(header)) {
throw new ArchivePolicyError(
"TAR_CHECKSUM",
`TAR header checksum failed at byte ${offset}.`,
);
}
const typeFlag = header[156] || 0x30;
const headerSize = parseTarNumber(header.subarray(124, 136), "entry size");
const dataOffset = offset + BLOCK_SIZE;
const paddedSize = Math.ceil(headerSize / BLOCK_SIZE) * BLOCK_SIZE;
if (
!Number.isSafeInteger(dataOffset + paddedSize) ||
dataOffset + paddedSize > bytes.byteLength
) {
throw new ArchivePolicyError(
"TRUNCATED_TAR",
"A TAR entry extends beyond the end of the archive.",
);
}
if (typeFlag === 0x78 || typeFlag === 0x67) {
if (headerSize > ARCHIVE_LIMITS.maxPaxHeaderBytes) {
throw new ArchivePolicyError(
"PAX_TOO_LARGE",
"A PAX metadata header exceeds the safety limit.",
);
}
const values = parsePax(
bytes.subarray(dataOffset, dataOffset + headerSize),
);
if (typeFlag === 0x67) globalPax = { ...globalPax, ...values };
else pendingPax = values;
offset = dataOffset + paddedSize;
continue;
}
if (typeFlag === 0x4c || typeFlag === 0x4b) {
throw new ArchivePolicyError(
"UNSUPPORTED_GNU_TAR",
"GNU long-name/link TAR extensions are unsupported; use PAX instead.",
);
}
const pax = { ...globalPax, ...pendingPax };
pendingPax = undefined;
const basePath = joinUstarPath(
readString(header.subarray(345, 500)),
readString(header.subarray(0, 100)),
);
const rawPath = pax.path ?? basePath;
const size =
pax.size === undefined
? headerSize
: parseDecimalSize(pax.size, "PAX size");
if (size !== headerSize) {
throw new ArchivePolicyError(
"PAX_SIZE_MISMATCH",
"PAX size disagrees with its TAR header size.",
);
}
const kind = tarKind(typeFlag);
const path = assessArchivePath(rawPath);
const entryIssues: ArchiveIssue[] = path.issues.map((candidate) => ({
...candidate,
entryId: String(entries.length),
}));
const duplicate = collisions.get(path.collisionKey);
if (duplicate !== undefined) {
const duplicateIssue: ArchiveIssue = {
code: "DUPLICATE_PATH",
message: `Path collides with entry ${duplicate}.`,
severity: "error",
entryId: String(entries.length),
};
entryIssues.push(duplicateIssue);
const prior = entries[Number(duplicate)];
if (
prior &&
!prior.issues.some((issue) => issue.code === "DUPLICATE_PATH")
) {
prior.issues.push({
...duplicateIssue,
message: `Path collides with entry ${entries.length}.`,
entryId: prior.id,
});
prior.extractable = false;
}
} else if (path.collisionKey)
collisions.set(path.collisionKey, String(entries.length));
if (kind !== "file" && kind !== "directory") {
entryIssues.push({
code: "SPECIAL_ENTRY",
message: `${kind} entries are listed but never restored.`,
severity: "error",
entryId: String(entries.length),
});
}
if (kind === "file") {
if (size > ARCHIVE_LIMITS.maxEntryBytes) {
entryIssues.push({
code: "ENTRY_TOO_LARGE",
message: "Entry exceeds the per-entry expanded-byte limit.",
severity: "error",
entryId: String(entries.length),
});
}
expandedBytes += size;
if (expandedBytes > ARCHIVE_LIMITS.maxExpandedBytes) {
throw new ArchivePolicyError(
"EXPANDED_LIMIT",
"TAR entries exceed the aggregate expanded-byte limit.",
);
}
}
if (entries.length >= ARCHIVE_LIMITS.maxEntries) {
throw new ArchivePolicyError(
"ENTRY_LIMIT",
`Archive contains more than ${ARCHIVE_LIMITS.maxEntries} entries.`,
);
}
const modified =
pax.mtime === undefined
? parseTarNumber(header.subarray(136, 148), "mtime")
: Number(pax.mtime);
const content = bytes.subarray(dataOffset, dataOffset + size);
const entry: ArchiveEntryRecord = {
id: String(entries.length),
sourceIndex: entries.length,
rawPath,
path: path.normalized || rawPath,
collisionKey: path.collisionKey,
kind,
size,
modifiedAt:
Number.isFinite(modified) && modified > 0
? new Date(modified * 1000).toISOString()
: undefined,
crc32: kind === "file" ? crc32Hex(content) : undefined,
compression: "stored",
extractable:
kind === "file" &&
entryIssues.every((candidate) => candidate.severity !== "error"),
issues: entryIssues,
dataOffset,
};
entries.push(entry);
offset = dataOffset + paddedSize;
}
if (zeroBlocks < 2)
throw new ArchivePolicyError(
"TRUNCATED_TAR",
"TAR archive is missing its two zero end blocks.",
);
if (bytes.subarray(offset).some((value) => value !== 0)) {
throw new ArchivePolicyError(
"APPENDED_TAR_DATA",
"Non-zero data follows the TAR end marker.",
);
}
if (pendingPax)
issues.push({
code: "ORPHAN_PAX",
message: "Trailing PAX metadata has no following entry.",
severity: "warning",
});
return { entries, issues, expandedBytes };
}
export async function createTar(
inputs: CreateInput[],
signal?: AbortSignal,
onProgress?: (update: ProgressUpdate) => void,
): Promise<Uint8Array> {
const chunks: Uint8Array[] = [];
let total = 0;
const append = (chunk: Uint8Array) => {
total += chunk.byteLength;
if (total > ARCHIVE_LIMITS.maxCreateBytes + inputs.length * 2048 + 1024) {
throw new ArchivePolicyError(
"CREATE_LIMIT",
"TAR output exceeds the bounded creation limit.",
);
}
chunks.push(chunk);
};
for (const [index, input] of inputs.entries()) {
throwIfAborted(signal);
const pathBytes = encoder.encode(input.path);
let headerPath = splitUstarPath(input.path);
if (!headerPath) {
const pax = encodePax({ path: input.path });
append(
createTarHeader(
`PaxHeaders/${String(index).padStart(6, "0")}`,
pax.byteLength,
0x78,
),
);
append(pax);
append(paddingFor(pax.byteLength));
headerPath = {
name: `file-${String(index).padStart(6, "0")}`,
prefix: "",
};
}
if (pathBytes.byteLength > ARCHIVE_LIMITS.maxPathBytes) {
throw new ArchivePolicyError(
"PATH_TOO_LONG",
"Creation path exceeds the UTF-8 path limit.",
);
}
append(
createTarHeader(
headerPath.name,
input.file.size,
0x30,
headerPath.prefix,
),
);
const data = new Uint8Array(await input.file.arrayBuffer());
throwIfAborted(signal);
append(data);
append(paddingFor(data.byteLength));
onProgress?.({
stage: "Creating TAR",
completed: index + 1,
total: inputs.length,
});
}
append(new Uint8Array(BLOCK_SIZE * 2));
return concatenate(chunks, total);
}
function tarKind(typeFlag: number): ArchiveEntryKind {
if (typeFlag === 0 || typeFlag === 0x30 || typeFlag === 0x37) return "file";
if (typeFlag === 0x35) return "directory";
if (typeFlag === 0x32) return "symlink";
if (typeFlag === 0x31) return "hardlink";
if (typeFlag === 0x33 || typeFlag === 0x34) return "device";
if (typeFlag === 0x36) return "fifo";
return "other";
}
function parsePax(bytes: Uint8Array): Record<string, string> {
const result: Record<string, string> = {};
let offset = 0;
while (offset < bytes.length) {
const space = bytes.indexOf(0x20, offset);
if (space < 0)
throw new ArchivePolicyError(
"INVALID_PAX",
"PAX record has no length separator.",
);
const lengthText = new TextDecoder("ascii", { fatal: true }).decode(
bytes.subarray(offset, space),
);
if (!/^\d+$/u.test(lengthText))
throw new ArchivePolicyError(
"INVALID_PAX",
"PAX record length is invalid.",
);
const length = Number(lengthText);
if (
!Number.isSafeInteger(length) ||
length <= space - offset + 2 ||
offset + length > bytes.length
) {
throw new ArchivePolicyError(
"INVALID_PAX",
"PAX record length is out of bounds.",
);
}
const record = bytes.subarray(space + 1, offset + length);
if (record.at(-1) !== 0x0a)
throw new ArchivePolicyError(
"INVALID_PAX",
"PAX record is not newline terminated.",
);
let text: string;
try {
text = decoder.decode(record.subarray(0, -1));
} catch {
throw new ArchivePolicyError(
"INVALID_PAX",
"PAX record is not valid UTF-8.",
);
}
const equals = text.indexOf("=");
if (equals <= 0)
throw new ArchivePolicyError(
"INVALID_PAX",
"PAX record has no key/value separator.",
);
result[text.slice(0, equals)] = text.slice(equals + 1);
offset += length;
}
return result;
}
function encodePax(values: Record<string, string>): Uint8Array {
const records: Uint8Array[] = [];
for (const [key, value] of Object.entries(values)) {
const body = `${key}=${value}\n`;
const bodyLength = encoder.encode(body).byteLength;
let length = bodyLength + 3;
while (`${length}`.length + 1 + bodyLength !== length)
length = `${length}`.length + 1 + bodyLength;
records.push(encoder.encode(`${length} ${body}`));
}
return concatenate(
records,
records.reduce((sum, record) => sum + record.byteLength, 0),
);
}
function createTarHeader(
name: string,
size: number,
typeFlag: number,
prefix = "",
): Uint8Array {
assertFiniteSafeInteger(size, "TAR entry size");
const header = new Uint8Array(BLOCK_SIZE);
writeString(header, 0, 100, name);
writeOctal(header, 100, 8, 0o644);
writeOctal(header, 108, 8, 0);
writeOctal(header, 116, 8, 0);
writeOctal(header, 124, 12, size);
writeOctal(header, 136, 12, 0);
header.fill(0x20, 148, 156);
header[156] = typeFlag;
writeString(header, 257, 6, "ustar");
header[262] = 0;
writeString(header, 263, 2, "00");
writeString(header, 345, 155, prefix);
writeChecksum(header, calculateHeaderChecksum(header));
return header;
}
function splitUstarPath(
path: string,
): { name: string; prefix: string } | undefined {
if ([...encoder.encode(path)].some((byte) => byte > 0x7f)) return undefined;
if (encoder.encode(path).byteLength <= 100) return { name: path, prefix: "" };
for (
let index = path.lastIndexOf("/");
index > 0;
index = path.lastIndexOf("/", index - 1)
) {
const prefix = path.slice(0, index);
const name = path.slice(index + 1);
if (
encoder.encode(prefix).byteLength <= 155 &&
encoder.encode(name).byteLength <= 100
)
return { name, prefix };
}
return undefined;
}
function calculateHeaderChecksum(header: Uint8Array): number {
let sum = 0;
for (let index = 0; index < BLOCK_SIZE; index += 1)
sum += index >= 148 && index < 156 ? 0x20 : header[index]!;
return sum;
}
function storedChecksum(header: Uint8Array): number {
return parseTarNumber(header.subarray(148, 156), "header checksum");
}
function parseTarNumber(field: Uint8Array, label: string): number {
if (field[0]! & 0x80) {
if (field[0]! & 0x40)
throw new ArchivePolicyError(
"NEGATIVE_TAR_NUMBER",
`${label} must not be negative.`,
);
let value = BigInt(field[0]! & 0x3f);
for (let index = 1; index < field.length; index += 1)
value = (value << 8n) | BigInt(field[index]!);
if (value > BigInt(Number.MAX_SAFE_INTEGER))
throw new ArchivePolicyError(
"TAR_NUMBER_RANGE",
`${label} is too large.`,
);
return Number(value);
}
const text = new TextDecoder("ascii")
.decode(field)
.replaceAll("\0", "")
.trim();
if (!text) return 0;
if (!/^[0-7]+$/u.test(text))
throw new ArchivePolicyError(
"INVALID_TAR_NUMBER",
`${label} is not octal.`,
);
const value = Number.parseInt(text, 8);
assertFiniteSafeInteger(value, label);
return value;
}
function parseDecimalSize(value: string, label: string): number {
if (!/^\d+$/u.test(value))
throw new ArchivePolicyError(
"INVALID_PAX_SIZE",
`${label} is not decimal.`,
);
const parsed = Number(value);
assertFiniteSafeInteger(parsed, label);
return parsed;
}
function readString(field: Uint8Array): string {
const zero = field.indexOf(0);
const value = zero < 0 ? field : field.subarray(0, zero);
try {
return decoder.decode(value);
} catch {
throw new ArchivePolicyError(
"INVALID_TAR_TEXT",
"TAR name fields must be valid UTF-8 in this version.",
);
}
}
function joinUstarPath(prefix: string, name: string): string {
return prefix ? `${prefix}/${name}` : name;
}
function writeString(
target: Uint8Array,
offset: number,
length: number,
value: string,
): void {
const bytes = encoder.encode(value);
if (bytes.byteLength > length)
throw new ArchivePolicyError(
"TAR_FIELD_RANGE",
"TAR text field is too long.",
);
target.set(bytes, offset);
}
function writeOctal(
target: Uint8Array,
offset: number,
length: number,
value: number,
): void {
const text = value.toString(8).padStart(length - 1, "0");
if (text.length > length - 1)
throw new ArchivePolicyError(
"TAR_FIELD_RANGE",
"TAR numeric field is too large.",
);
target.set(new TextEncoder().encode(text), offset);
target[offset + length - 1] = 0;
}
function writeChecksum(target: Uint8Array, value: number): void {
const text = value.toString(8).padStart(6, "0");
if (text.length > 6)
throw new ArchivePolicyError(
"TAR_FIELD_RANGE",
"TAR checksum field is too large.",
);
target.set(encoder.encode(text), 148);
target[154] = 0;
target[155] = 0x20;
}
function paddingFor(size: number): Uint8Array {
const padding = (BLOCK_SIZE - (size % BLOCK_SIZE)) % BLOCK_SIZE;
return new Uint8Array(padding);
}
function isZeroBlock(block: Uint8Array): boolean {
return block.every((value) => value === 0);
}
function concatenate(chunks: Uint8Array[], size: number): Uint8Array {
const output = new Uint8Array(size);
let offset = 0;
for (const chunk of chunks) {
output.set(chunk, offset);
offset += chunk.byteLength;
}
return output;
}
src/archive/types.ts
+103
View File
@@ -0,0 +1,103 @@
export type ArchiveFormat = "zip" | "tar" | "tar.gz" | "gzip";
export type ArchiveEntryKind =
"file" | "directory" | "symlink" | "hardlink" | "device" | "fifo" | "other";
export type ArchiveIssueSeverity = "info" | "warning" | "error";
export interface ArchiveIssue {
code: string;
message: string;
severity: ArchiveIssueSeverity;
entryId?: string;
}
export interface ArchiveEntryRecord {
id: string;
sourceIndex: number;
rawPath: string;
path: string;
collisionKey: string;
kind: ArchiveEntryKind;
size: number;
compressedSize?: number;
modifiedAt?: string;
crc32?: string;
compression?: string;
zip64?: boolean;
encrypted?: boolean;
extractable: boolean;
issues: ArchiveIssue[];
/** Internal byte offset for TAR/GZIP-backed documents. */
dataOffset?: number;
}
export interface ArchiveDocument {
name: string;
format: ArchiveFormat;
source: File;
sourceBytes: number;
entries: ArchiveEntryRecord[];
issues: ArchiveIssue[];
expandedBytes: number;
compressedBytes: number;
zip64: boolean;
/** Bounded decompressed TAR or GZIP bytes retained for local previews. */
payload?: Uint8Array;
}
export interface ArchiveSummary {
name: string;
format: ArchiveFormat;
sourceBytes: number;
entries: number;
files: number;
directories: number;
blocked: number;
expandedBytes: number;
compressedBytes: number;
zip64: boolean;
issues: ArchiveIssue[];
}
export type PreviewResult =
| {
kind: "text";
text: string;
truncated: boolean;
note?: string;
}
| {
kind: "hex";
text: string;
truncated: boolean;
note?: string;
}
| {
kind: "image";
blob: Blob;
mimeType: string;
width: number;
height: number;
note?: string;
};
export interface CompareRecord {
path: string;
status: "same" | "changed" | "only-left" | "only-right" | "type-changed";
left?: ArchiveEntryRecord;
right?: ArchiveEntryRecord;
}
export interface CreateInput {
path: string;
file: File;
}
export type CreateFormat = "zip" | "tar" | "tar.gz";
export interface ProgressUpdate {
stage: string;
completed: number;
total: number;
}
src/archive/zip.ts
+388
View File
@@ -0,0 +1,388 @@
import {
BlobReader,
BlobWriter,
ZipReader,
ZipWriter,
type Entry,
type FileEntry,
} from "@zip.js/zip.js";
import { ArchivePolicyError } from "./errors";
import {
ARCHIVE_LIMITS,
assertFiniteSafeInteger,
throwIfAborted,
} from "./limits";
import { assessArchivePath } from "./paths";
import type {
ArchiveEntryKind,
ArchiveEntryRecord,
ArchiveIssue,
CreateInput,
ProgressUpdate,
} from "./types";
export interface ParsedZip {
entries: ArchiveEntryRecord[];
issues: ArchiveIssue[];
expandedBytes: number;
compressedBytes: number;
zip64: boolean;
}
const readerOptions = {
strictness: "balanced" as const,
filenameValidation: "tolerant" as const,
maxAppendedDataSize: 0,
useWebWorkers: false,
};
export async function parseZip(
file: File,
signal?: AbortSignal,
): Promise<ParsedZip> {
rejectMultipartName(file.name);
const reader = new ZipReader(new BlobReader(file), readerOptions);
const entries: ArchiveEntryRecord[] = [];
const issues: ArchiveIssue[] = [];
const collisions = new Map<string, string>();
let expandedBytes = 0;
let compressedBytes = 0;
let zip64 = false;
try {
for await (const candidate of reader.getEntriesGenerator()) {
throwIfAborted(signal);
if (entries.length >= ARCHIVE_LIMITS.maxEntries) {
throw new ArchivePolicyError(
"ENTRY_LIMIT",
`Archive contains more than ${ARCHIVE_LIMITS.maxEntries} entries.`,
);
}
assertFiniteSafeInteger(candidate.compressedSize, "ZIP compressed size");
assertFiniteSafeInteger(
candidate.uncompressedSize,
"ZIP uncompressed size",
);
const id = String(entries.length);
const path = assessArchivePath(candidate.filename);
const entryIssues: ArchiveIssue[] = path.issues.map((item) => ({
...item,
entryId: id,
}));
const kind = zipKind(candidate);
const duplicate = collisions.get(path.collisionKey);
if (duplicate !== undefined) {
const duplicateIssue: ArchiveIssue = {
code: "DUPLICATE_PATH",
message: `Path collides with entry ${duplicate}.`,
severity: "error",
entryId: id,
};
entryIssues.push(duplicateIssue);
const prior = entries[Number(duplicate)];
if (
prior &&
!prior.issues.some((issue) => issue.code === "DUPLICATE_PATH")
) {
prior.issues.push({
...duplicateIssue,
message: `Path collides with entry ${id}.`,
entryId: prior.id,
});
prior.extractable = false;
}
} else if (path.collisionKey) collisions.set(path.collisionKey, id);
if (candidate.diskNumberStart !== 0) {
entryIssues.push({
code: "MULTIPART_ZIP",
message: "Split or multipart ZIP entries are unsupported.",
severity: "error",
entryId: id,
});
}
if (candidate.encrypted) {
entryIssues.push({
code: "ENCRYPTED_ENTRY",
message:
"Encrypted entries are listed but cannot be previewed or exported.",
severity: "error",
entryId: id,
});
}
if (kind !== "file" && kind !== "directory") {
entryIssues.push({
code: "SPECIAL_ENTRY",
message: `${kind} entries are listed but never restored.`,
severity: "error",
entryId: id,
});
}
if (
candidate.compressionMethod !== 0 &&
candidate.compressionMethod !== 8
) {
entryIssues.push({
code: "UNSUPPORTED_COMPRESSION",
message: `ZIP compression method ${candidate.compressionMethod} is unsupported.`,
severity: "error",
entryId: id,
});
}
if (candidate.uncompressedSize > ARCHIVE_LIMITS.maxEntryBytes) {
entryIssues.push({
code: "ENTRY_TOO_LARGE",
message: "Entry exceeds the per-entry expanded-byte limit.",
severity: "error",
entryId: id,
});
}
if (
kind === "file" &&
candidate.uncompressedSize > 0 &&
candidate.compressedSize === 0
) {
entryIssues.push({
code: "INVALID_COMPRESSED_SIZE",
message: "A non-empty ZIP entry declares zero compressed bytes.",
severity: "error",
entryId: id,
});
}
if (
kind === "file" &&
!candidate.encrypted &&
candidate.crc32 === undefined
) {
entryIssues.push({
code: "MISSING_CRC32",
message: "An unencrypted ZIP file entry has no CRC-32 value.",
severity: "error",
entryId: id,
});
}
const ratio =
candidate.uncompressedSize / Math.max(1, candidate.compressedSize);
if (
candidate.uncompressedSize > 0 &&
ratio > ARCHIVE_LIMITS.maxCompressionRatio
) {
entryIssues.push({
code: "COMPRESSION_RATIO",
message: `Compression ratio ${ratio.toFixed(1)}:1 exceeds the ${ARCHIVE_LIMITS.maxCompressionRatio}:1 policy.`,
severity: "error",
entryId: id,
});
}
expandedBytes += kind === "file" ? candidate.uncompressedSize : 0;
compressedBytes += kind === "file" ? candidate.compressedSize : 0;
if (expandedBytes > ARCHIVE_LIMITS.maxExpandedBytes) {
throw new ArchivePolicyError(
"EXPANDED_LIMIT",
"ZIP entries exceed the aggregate expanded-byte limit.",
);
}
zip64 ||= candidate.zip64;
entries.push({
id,
sourceIndex: entries.length,
rawPath: candidate.filename,
path: path.normalized || candidate.filename,
collisionKey: path.collisionKey,
kind,
size: candidate.uncompressedSize,
compressedSize: candidate.compressedSize,
modifiedAt: validDate(candidate.lastModDate),
crc32:
candidate.crc32 === undefined
? undefined
: (candidate.crc32 >>> 0).toString(16).padStart(8, "0"),
compression: compressionName(candidate.compressionMethod),
zip64: candidate.zip64,
encrypted: candidate.encrypted,
extractable:
kind === "file" &&
entryIssues.every((item) => item.severity !== "error"),
issues: entryIssues,
});
}
for (const warning of reader.warnings ?? []) {
issues.push({
code: warning.reason,
message: warning.filename
? `${warning.reason}: ${warning.filename}`
: warning.reason,
severity: "warning",
});
}
} finally {
await reader.close();
}
return { entries, issues, expandedBytes, compressedBytes, zip64 };
}
export async function readZipEntries(
file: File,
sourceIndices: number[],
maxEntryBytes: number,
signal?: AbortSignal,
): Promise<Map<number, Uint8Array>> {
const wanted = new Set(sourceIndices);
const selected = new Map<number, FileEntry>();
const reader = new ZipReader(new BlobReader(file), readerOptions);
try {
let index = 0;
for await (const candidate of reader.getEntriesGenerator()) {
throwIfAborted(signal);
if (wanted.has(index)) {
if (candidate.directory)
throw new ArchivePolicyError(
"NOT_A_FILE",
`${candidate.filename} is a directory.`,
);
selected.set(index, candidate);
}
index += 1;
if (selected.size === wanted.size) break;
}
if (selected.size !== wanted.size)
throw new ArchivePolicyError(
"MISSING_ENTRY",
"An entry is no longer present in the ZIP.",
);
const result = new Map<number, Uint8Array>();
for (const sourceIndex of sourceIndices) {
const entry = selected.get(sourceIndex)!;
if (entry.encrypted)
throw new ArchivePolicyError(
"ENCRYPTED_ENTRY",
"Encrypted ZIP entries are unsupported.",
);
if (entry.uncompressedSize > maxEntryBytes) {
throw new ArchivePolicyError(
"ENTRY_TOO_LARGE",
`${entry.filename} exceeds this operation's byte limit.`,
);
}
const collector = boundedCollector(maxEntryBytes, signal);
await entry.getData(collector.stream, {
signal,
strictness: "strict",
checkCrc32: true,
checkOverlappingEntry: true,
useWebWorkers: false,
});
result.set(sourceIndex, collector.bytes());
}
return result;
} finally {
await reader.close();
}
}
export async function createZip(
inputs: CreateInput[],
signal?: AbortSignal,
onProgress?: (update: ProgressUpdate) => void,
): Promise<Blob> {
const writer = new ZipWriter(new BlobWriter("application/zip"), {
level: 6,
bufferedWrite: true,
keepOrder: true,
useWebWorkers: false,
useCompressionStream: false,
extendedTimestamp: false,
dataDescriptor: false,
useUnicodeFileNames: true,
});
try {
for (const [index, input] of inputs.entries()) {
throwIfAborted(signal);
await writer.add(input.path, new BlobReader(input.file), {
level: 6,
rawLastModDate: 0x00210000,
lastModDate: new Date("1980-01-01T00:00:00.000Z"),
extendedTimestamp: false,
dataDescriptor: false,
useWebWorkers: false,
useCompressionStream: false,
unixMode: 0o100644,
signal,
});
onProgress?.({
stage: "Creating ZIP",
completed: index + 1,
total: inputs.length,
});
}
return await writer.close();
} catch (error) {
try {
await writer.close();
} catch {
// Preserve the operation's original error.
}
throw error;
}
}
function zipKind(entry: Entry): ArchiveEntryKind {
if (entry.directory) return "directory";
if (entry.symlink) return "symlink";
const fileType = (entry.unixMode ?? 0) & 0o170000;
if (!fileType || fileType === 0o100000) return "file";
if (fileType === 0o040000) return "directory";
if (fileType === 0o120000) return "symlink";
if (fileType === 0o010000) return "fifo";
if (fileType === 0o020000 || fileType === 0o060000) return "device";
return "other";
}
function compressionName(method: number): string {
if (method === 0) return "stored";
if (method === 8) return "deflate";
return `method ${method}`;
}
function validDate(date: Date): string | undefined {
return Number.isFinite(date.getTime()) ? date.toISOString() : undefined;
}
function rejectMultipartName(name: string): void {
if (/\.(?:z\d\d|zip\.\d{3,})$/iu.test(name)) {
throw new ArchivePolicyError(
"MULTIPART_ZIP",
"Split or multipart ZIP archives are unsupported.",
);
}
}
function boundedCollector(limit: number, signal?: AbortSignal) {
const chunks: Uint8Array[] = [];
let total = 0;
return {
stream: new WritableStream<Uint8Array>({
write(chunk) {
throwIfAborted(signal);
total += chunk.byteLength;
if (total > limit)
throw new ArchivePolicyError(
"EXPANDED_LIMIT",
"Decompressed entry exceeds the operation limit.",
);
chunks.push(chunk.slice());
},
}),
bytes() {
const output = new Uint8Array(total);
let offset = 0;
for (const chunk of chunks) {
output.set(chunk, offset);
offset += chunk.byteLength;
}
return output;
},
};
}
src/components/ErrorBoundary.tsx
+27
View File
@@ -0,0 +1,27 @@
import { Component, type ErrorInfo, type ReactNode } from "react";
export class ErrorBoundary extends Component<
{ children: ReactNode },
{ error?: Error }
> {
state: { error?: Error } = {};
static getDerivedStateFromError(error: Error) {
return { error };
}
componentDidCatch(error: Error, info: ErrorInfo) {
console.error("Application failure", error, info);
}
render() {
if (this.state.error)
return (
<main className="fatal">
<h1>Archive Tools could not continue</h1>
<p>{this.state.error.message}</p>
<button type="button" onClick={() => location.reload()}>
Reload
</button>
</main>
);
return this.props.children;
}
}
src/components/HelpDialog.tsx
+67
View File
@@ -0,0 +1,67 @@
import { useEffect, useRef } from "react";
export function HelpDialog({
open,
onClose,
}: {
open: boolean;
onClose: () => void;
}) {
const dialog = useRef<HTMLDialogElement>(null);
useEffect(() => {
const node = dialog.current;
if (!node) return;
if (open && !node.open) node.showModal();
if (!open && node.open) node.close();
}, [open]);
return (
<dialog
ref={dialog}
className="help-dialog"
onClose={onClose}
onCancel={onClose}
aria-labelledby="help-title"
>
<div className="dialog-heading">
<div>
<p className="eyebrow">Local-first help</p>
<h2 id="help-title">About Archive Tools</h2>
</div>
<button type="button" onClick={onClose} aria-label="Close help">
×
</button>
</div>
<div className="help-copy">
<p>
Inspect ZIP/ZIP64, TAR/USTAR/PAX, gzip and tar.gz files without
uploading them.
</p>
<h3>Safe repackaging</h3>
<p>
Select regular entries and Archive Tools verifies their content before
placing it in a newly created ZIP. It never restores archive paths
directly onto your filesystem.
</p>
<h3>Intentional boundaries</h3>
<p>
Encryption, split ZIPs, nested archive expansion, GNU TAR extensions,
symlinks, hardlinks, device nodes and FIFOs are unsupported. Unsafe
paths, duplicates, excessive sizes and suspicious compression ratios
are blocked.
</p>
<h3>Previews and comparison</h3>
<p>
Plain UTF-8 text, bounded hexadecimal data and static JPEG/PNG/WebP
images can be previewed. Comparisons use normalized path, type,
expanded size and CRC-32.
</p>
<h3>Deterministic creation</h3>
<p>
Creation sorts files by path and normalizes timestamps, ownership and
permissions. ZIP compression is pinned to a fixed implementation and
level.
</p>
</div>
</dialog>
);
}
src/components/Workbench.tsx
+63
View File
@@ -0,0 +1,63 @@
import { useState } from "react";
import { CompareWorkspace } from "./workspaces/CompareWorkspace";
import { CreateWorkspace } from "./workspaces/CreateWorkspace";
import { InspectWorkspace } from "./workspaces/InspectWorkspace";
type Workspace = "inspect" | "create" | "compare";
const workspaces: Array<{ id: Workspace; label: string; description: string }> =
[
{
id: "inspect",
label: "Inspect & extract",
description:
"Inventory entries, preview bounded content and repackage a safe selection.",
},
{
id: "create",
label: "Create",
description:
"Build reproducible ZIP, TAR or tar.gz archives from local files.",
},
{
id: "compare",
label: "Compare",
description:
"Compare two archive inventories by safe path, type, size and CRC-32.",
},
];
export function Workbench() {
const [workspace, setWorkspace] = useState<Workspace>("inspect");
return (
<main className="workbench">
<header className="hero">
<div>
<p className="eyebrow">Local-first archive workbench</p>
<h1>Archive Tools</h1>
<p>
Inspect, create, compare and safely repackage archives without
uploading them.
</p>
</div>
<span className="privacy-pill">Browser-local</span>
</header>
<nav className="workspace-tabs" aria-label="Archive workspaces">
{workspaces.map((item) => (
<button
key={item.id}
type="button"
aria-selected={workspace === item.id}
onClick={() => setWorkspace(item.id)}
title={item.description}
>
{item.label}
</button>
))}
</nav>
{workspace === "inspect" ? <InspectWorkspace /> : null}
{workspace === "create" ? <CreateWorkspace /> : null}
{workspace === "compare" ? <CompareWorkspace /> : null}
</main>
);
}
src/components/workspaces/ArchiveSummaryView.tsx
+58
View File
@@ -0,0 +1,58 @@
import { formatBytes } from "../../archive/limits";
import { archiveSummary } from "../../archive/service";
import type { ArchiveDocument } from "../../archive/types";
export function ArchiveSummaryView({
document,
}: {
document: ArchiveDocument;
}) {
const summary = archiveSummary(document);
const errors = summary.issues.filter(
(issue) => issue.severity === "error",
).length;
const warnings = summary.issues.filter(
(issue) => issue.severity === "warning",
).length;
return (
<section className="archive-summary" aria-label="Archive summary">
<dl>
<div>
<dt>Format</dt>
<dd>
{summary.format.toLocaleUpperCase("en-US")}
{summary.zip64 ? " / ZIP64" : ""}
</dd>
</div>
<div>
<dt>Entries</dt>
<dd>{summary.entries.toLocaleString()}</dd>
</div>
<div>
<dt>Expanded</dt>
<dd>{formatBytes(summary.expandedBytes)}</dd>
</div>
<div>
<dt>Source</dt>
<dd>{formatBytes(summary.sourceBytes)}</dd>
</div>
<div>
<dt>Blocked files</dt>
<dd className={summary.blocked ? "danger-text" : undefined}>
{summary.blocked}
</dd>
</div>
<div>
<dt>Diagnostics</dt>
<dd>
{errors} errors · {warnings} warnings
</dd>
</div>
</dl>
<p className="policy-note">
CRC is verified when ZIP content is read. TAR headers and gzip payloads
were verified during inspection.
</p>
</section>
);
}
src/components/workspaces/CompareWorkspace.tsx
+206
View File
@@ -0,0 +1,206 @@
import { useMemo, useRef, useState } from "react";
import { compareArchives } from "../../archive/compare";
import { downloadBlob, outputStem } from "../../archive/downloads";
import { errorMessage } from "../../archive/errors";
import { formatBytes } from "../../archive/limits";
import { inspectArchive } from "../../archive/service";
import type { ArchiveDocument, CompareRecord } from "../../archive/types";
import { StatusMessage } from "./StatusMessage";
export function CompareWorkspace() {
const [leftFile, setLeftFile] = useState<File>();
const [rightFile, setRightFile] = useState<File>();
const [left, setLeft] = useState<ArchiveDocument>();
const [right, setRight] = useState<ArchiveDocument>();
const [rows, setRows] = useState<CompareRecord[]>([]);
const [changesOnly, setChangesOnly] = useState(true);
const [busy, setBusy] = useState(false);
const [status, setStatus] = useState<string>();
const [error, setError] = useState<string>();
const controller = useRef<AbortController | undefined>(undefined);
const visible = useMemo(
() => rows.filter((row) => !changesOnly || row.status !== "same"),
[changesOnly, rows],
);
async function compare() {
if (!leftFile || !rightFile) return;
controller.current?.abort();
const next = new AbortController();
controller.current = next;
setBusy(true);
setError(undefined);
setStatus("Inspecting both archives locally…");
try {
const [leftDocument, rightDocument] = await Promise.all([
inspectArchive(leftFile, next.signal),
inspectArchive(rightFile, next.signal),
]);
const comparison = compareArchives(leftDocument, rightDocument);
setLeft(leftDocument);
setRight(rightDocument);
setRows(comparison);
setStatus(
`Compared ${comparison.length.toLocaleString()} normalized paths.`,
);
} catch (reason) {
if (!next.signal.aborted) setError(errorMessage(reason));
} finally {
if (controller.current === next) setBusy(false);
}
}
function downloadReport() {
if (!left || !right) return;
const report = {
schema: "de.add-ideas.archive-tools.comparison.v1",
generatedAt: new Date().toISOString(),
left: {
name: left.name,
format: left.format,
sourceBytes: left.sourceBytes,
},
right: {
name: right.name,
format: right.format,
sourceBytes: right.sourceBytes,
},
comparison: rows.map((row) => ({
path: row.path,
status: row.status,
left: compact(row.left),
right: compact(row.right),
})),
};
downloadBlob(
new Blob([`${JSON.stringify(report, null, 2)}\n`], {
type: "application/json",
}),
`${outputStem(left.name)}-vs-${outputStem(right.name)}.json`,
);
}
return (
<section
className="panel workspace-panel"
aria-labelledby="compare-heading"
>
<div className="panel-heading">
<div>
<p className="eyebrow">Inventory diff</p>
<h2 id="compare-heading">Compare archives</h2>
</div>
</div>
<div className="compare-inputs">
<label className="field">
<span>Left archive</span>
<input
type="file"
accept=".zip,.tar,.tgz,.gz"
onChange={(event) => {
setLeftFile(event.currentTarget.files?.[0]);
event.currentTarget.value = "";
}}
/>
</label>
<label className="field">
<span>Right archive</span>
<input
type="file"
accept=".zip,.tar,.tgz,.gz"
onChange={(event) => {
setRightFile(event.currentTarget.files?.[0]);
event.currentTarget.value = "";
}}
/>
</label>
</div>
<p className="policy-note">
Regular files compare by normalized collision-safe path, type, expanded
size and CRC-32. Dates and compression layout do not affect equality.
</p>
<StatusMessage error={error} status={status} />
<div className="button-row">
<button
className="primary-button"
type="button"
disabled={!leftFile || !rightFile || busy}
onClick={() => void compare()}
>
Compare locally
</button>
{busy ? (
<button
type="button"
onClick={() => {
controller.current?.abort();
setStatus("Operation cancelled.");
}}
>
Cancel
</button>
) : null}
{rows.length ? (
<button type="button" onClick={downloadReport}>
Download comparison
</button>
) : null}
</div>
{rows.length ? (
<div className="comparison-results">
<label className="check-label">
<input
type="checkbox"
checked={changesOnly}
onChange={(event) => setChangesOnly(event.target.checked)}
/>{" "}
Show changes only
</label>
<div className="table-scroll">
<table className="entry-table">
<thead>
<tr>
<th scope="col">Path</th>
<th scope="col">State</th>
<th scope="col">Left</th>
<th scope="col">Right</th>
</tr>
</thead>
<tbody>
{visible.map((row, index) => (
<tr key={`${row.path}-${index}`}>
<th scope="row">{row.path}</th>
<td>
<span className={`compare-state state-${row.status}`}>
{row.status}
</span>
</td>
<td>{entryLabel(row.left)}</td>
<td>{entryLabel(row.right)}</td>
</tr>
))}
</tbody>
</table>
</div>
</div>
) : null}
</section>
);
}
function entryLabel(entry?: CompareRecord["left"]): string {
return entry
? `${entry.kind} · ${formatBytes(entry.size)}${entry.crc32 ? ` · ${entry.crc32}` : ""}`
: "—";
}
function compact(entry?: CompareRecord["left"]) {
return entry
? {
path: entry.path,
kind: entry.kind,
size: entry.size,
crc32: entry.crc32,
}
: undefined;
}
src/components/workspaces/CreateWorkspace.tsx
+148
View File
@@ -0,0 +1,148 @@
import { useRef, useState } from "react";
import { downloadBlob } from "../../archive/downloads";
import { errorMessage } from "../../archive/errors";
import { ARCHIVE_LIMITS, formatBytes } from "../../archive/limits";
import { createArchive } from "../../archive/service";
import type { CreateFormat } from "../../archive/types";
import { StatusMessage } from "./StatusMessage";
export function CreateWorkspace() {
const [files, setFiles] = useState<File[]>([]);
const [format, setFormat] = useState<CreateFormat>("zip");
const [name, setName] = useState("archive");
const [busy, setBusy] = useState(false);
const [status, setStatus] = useState<string>();
const [error, setError] = useState<string>();
const controller = useRef<AbortController | undefined>(undefined);
const total = files.reduce((sum, file) => sum + file.size, 0);
async function build() {
controller.current?.abort();
const next = new AbortController();
controller.current = next;
setBusy(true);
setError(undefined);
try {
const blob = await createArchive(files, format, next.signal, (progress) =>
setStatus(
`${progress.stage}: ${progress.completed} / ${progress.total}`,
),
);
const extension = format === "tar.gz" ? "tar.gz" : format;
downloadBlob(blob, `${name.trim() || "archive"}.${extension}`);
setStatus(
`Created deterministic ${format.toLocaleUpperCase("en-US")} locally.`,
);
} catch (reason) {
if (!next.signal.aborted) setError(errorMessage(reason));
} finally {
if (controller.current === next) setBusy(false);
}
}
return (
<section className="panel workspace-panel" aria-labelledby="create-heading">
<div className="panel-heading">
<div>
<p className="eyebrow">Reproducible output</p>
<h2 id="create-heading">Create an archive</h2>
</div>
</div>
<div className="create-grid">
<div className="form-stack">
<label className="field">
<span>Files</span>
<input
type="file"
multiple
onChange={(event) => {
setFiles([...(event.currentTarget.files ?? [])]);
event.currentTarget.value = "";
}}
/>
</label>
<div className="field-grid">
<label className="field">
<span>Output name</span>
<input
value={name}
onChange={(event) => setName(event.target.value)}
/>
</label>
<label className="field">
<span>Format</span>
<select
value={format}
onChange={(event) =>
setFormat(event.target.value as CreateFormat)
}
>
<option value="zip">ZIP (DEFLATE)</option>
<option value="tar">TAR / PAX</option>
<option value="tar.gz">tar.gz</option>
</select>
</label>
</div>
<p className="policy-note">
Files are sorted by normalized path. Timestamps, owner IDs and
permissions are normalized; ZIP compression uses a fixed
implementation and level.
</p>
<StatusMessage error={error} status={status} />
<div className="button-row">
<button
className="primary-button"
type="button"
disabled={
!files.length || busy || total > ARCHIVE_LIMITS.maxCreateBytes
}
onClick={() => void build()}
>
Create & download
</button>
{busy ? (
<button
type="button"
onClick={() => {
controller.current?.abort();
setStatus("Operation cancelled.");
}}
>
Cancel
</button>
) : null}
<button
type="button"
disabled={!files.length || busy}
onClick={() => setFiles([])}
>
Clear
</button>
</div>
</div>
<aside className="file-selection-summary">
<h3>Selection</h3>
<p>
<strong>{files.length.toLocaleString()}</strong> files ·{" "}
<strong>{formatBytes(total)}</strong>
</p>
<p className="policy-note">
Limits: {ARCHIVE_LIMITS.maxCreateFiles.toLocaleString()} files and{" "}
{formatBytes(ARCHIVE_LIMITS.maxCreateBytes)} total input.
</p>
<ul>
{files.slice(0, 30).map((file, index) => (
<li key={`${file.name}-${file.size}-${index}`}>
<span>{file.webkitRelativePath || file.name}</span>
<span>{formatBytes(file.size)}</span>
</li>
))}
</ul>
{files.length > 30 ? (
<p className="policy-note">…and {files.length - 30} more</p>
) : null}
</aside>
</div>
</section>
);
}
src/components/workspaces/InspectWorkspace.tsx
+357
View File
@@ -0,0 +1,357 @@
import { useMemo, useRef, useState } from "react";
import { downloadBlob, outputStem } from "../../archive/downloads";
import { errorMessage } from "../../archive/errors";
import { ARCHIVE_LIMITS, formatBytes } from "../../archive/limits";
import { previewEntry } from "../../archive/preview";
import {
createSafeSelectionZip,
inspectArchive,
reportJson,
} from "../../archive/service";
import type {
ArchiveDocument,
ArchiveEntryRecord,
PreviewResult,
ProgressUpdate,
} from "../../archive/types";
import { ArchiveSummaryView } from "./ArchiveSummaryView";
import { PreviewPane } from "./PreviewPane";
import { StatusMessage } from "./StatusMessage";
type EntryFilter = "all" | "safe" | "blocked";
export function InspectWorkspace() {
const [document, setDocument] = useState<ArchiveDocument>();
const [selected, setSelected] = useState<Set<string>>(new Set());
const [query, setQuery] = useState("");
const [filter, setFilter] = useState<EntryFilter>("all");
const [busy, setBusy] = useState(false);
const [status, setStatus] = useState<string>();
const [error, setError] = useState<string>();
const [activeEntry, setActiveEntry] = useState<ArchiveEntryRecord>();
const [preview, setPreview] = useState<PreviewResult>();
const [previewBusy, setPreviewBusy] = useState(false);
const [previewError, setPreviewError] = useState<string>();
const operation = useRef<AbortController | undefined>(undefined);
const generation = useRef(0);
const visible = useMemo(() => {
if (!document) return [];
const normalizedQuery = query.trim().toLocaleLowerCase("en-US");
return document.entries
.filter(
(entry) =>
!normalizedQuery ||
entry.path.toLocaleLowerCase("en-US").includes(normalizedQuery),
)
.filter(
(entry) =>
filter === "all" ||
(filter === "safe"
? entry.extractable
: !entry.extractable && entry.kind !== "directory"),
)
.slice(0, ARCHIVE_LIMITS.maxDisplayedEntries);
}, [document, filter, query]);
async function openFile(file?: File) {
if (!file) return;
operation.current?.abort();
const controller = new AbortController();
operation.current = controller;
const current = ++generation.current;
setBusy(true);
setPreviewBusy(false);
setError(undefined);
setStatus(`Inspecting ${file.name}…`);
try {
const next = await inspectArchive(file, controller.signal);
if (current !== generation.current) return;
setDocument(next);
setSelected(new Set());
setActiveEntry(undefined);
setPreview(undefined);
setPreviewError(undefined);
setStatus(
`Inspected ${next.entries.length.toLocaleString()} entries locally.`,
);
} catch (reason) {
if (controller.signal.aborted) return;
if (current === generation.current) setError(errorMessage(reason));
} finally {
if (current === generation.current) setBusy(false);
}
}
async function showPreview(entry: ArchiveEntryRecord) {
if (!document) return;
operation.current?.abort();
const controller = new AbortController();
operation.current = controller;
const current = ++generation.current;
setActiveEntry(entry);
setPreview(undefined);
setPreviewBusy(true);
setPreviewError(undefined);
try {
const next = await previewEntry(document, entry, controller.signal);
if (current === generation.current) setPreview(next);
} catch (reason) {
if (!controller.signal.aborted && current === generation.current)
setPreviewError(errorMessage(reason));
} finally {
if (current === generation.current) setPreviewBusy(false);
}
}
async function extractSelection() {
if (!document) return;
operation.current?.abort();
const controller = new AbortController();
operation.current = controller;
const current = ++generation.current;
setBusy(true);
setPreviewBusy(false);
setError(undefined);
try {
const blob = await createSafeSelectionZip(
document,
[...selected],
controller.signal,
progressStatus(setStatus),
);
if (current !== generation.current) return;
downloadBlob(blob, `${outputStem(document.name)}-safe-selection.zip`);
setStatus(
`Verified and repackaged ${selected.size} safe files into a new ZIP.`,
);
} catch (reason) {
if (!controller.signal.aborted && current === generation.current)
setError(errorMessage(reason));
} finally {
if (current === generation.current) setBusy(false);
}
}
function toggle(entry: ArchiveEntryRecord) {
setSelected((current) => {
const next = new Set(current);
if (next.has(entry.id)) next.delete(entry.id);
else next.add(entry.id);
return next;
});
}
function cancel() {
generation.current += 1;
operation.current?.abort(
new DOMException("Operation cancelled.", "AbortError"),
);
setBusy(false);
setPreviewBusy(false);
setStatus("Operation cancelled.");
}
const safeVisible = visible.filter((entry) => entry.extractable);
return (
<section
className="panel workspace-panel"
aria-labelledby="inspect-heading"
>
<div className="panel-heading">
<div>
<p className="eyebrow">ZIP · TAR · gzip</p>
<h2 id="inspect-heading">Inspect and safely repackage</h2>
</div>
<div className="button-row">
<label className="button primary-button">
Choose archive
<input
className="visually-hidden"
type="file"
accept=".zip,.tar,.tgz,.gz,application/zip,application/gzip,application/x-tar"
onChange={(event) => {
const file = event.currentTarget.files?.[0];
event.currentTarget.value = "";
void openFile(file);
}}
/>
</label>
{busy || previewBusy ? (
<button type="button" onClick={cancel}>
Cancel
</button>
) : null}
</div>
</div>
<p className="policy-note">
Encrypted and multipart ZIPs, nested expansion, symlinks, hardlinks,
devices and FIFOs are intentionally unsupported.
</p>
<StatusMessage error={error} status={status} />
{document ? (
<ArchiveSummaryView document={document} />
) : (
<div className="drop-prompt">
<strong>Open a local archive</strong>
<span>
It is inspected in this browser under fixed path, count, size and
ratio limits.
</span>
</div>
)}
{document ? (
<div className="inspect-layout">
<div className="inventory-pane">
<div className="inventory-toolbar">
<label className="field">
<span>Find path</span>
<input
type="search"
value={query}
onChange={(event) => setQuery(event.target.value)}
placeholder="Search entries"
/>
</label>
<label className="field">
<span>Show</span>
<select
value={filter}
onChange={(event) =>
setFilter(event.target.value as EntryFilter)
}
>
<option value="all">All entries</option>
<option value="safe">Safe files</option>
<option value="blocked">Blocked</option>
</select>
</label>
</div>
<div className="selection-toolbar">
<button
type="button"
onClick={() =>
setSelected(new Set(safeVisible.map((entry) => entry.id)))
}
disabled={!safeVisible.length}
>
Select visible safe
</button>
<button
type="button"
onClick={() => setSelected(new Set())}
disabled={!selected.size}
>
Clear selection
</button>
<span>{selected.size} selected</span>
</div>
<div className="table-scroll">
<table className="entry-table">
<thead>
<tr>
<th scope="col">
<span className="visually-hidden">Select</span>
</th>
<th scope="col">Path</th>
<th scope="col">Kind</th>
<th scope="col">Size</th>
<th scope="col">State</th>
</tr>
</thead>
<tbody>
{visible.map((entry) => (
<tr
key={entry.id}
className={
!entry.extractable && entry.kind !== "directory"
? "blocked-row"
: undefined
}
>
<td>
<input
type="checkbox"
aria-label={`Select ${entry.path}`}
checked={selected.has(entry.id)}
disabled={!entry.extractable || busy}
onChange={() => toggle(entry)}
/>
</td>
<th scope="row">
<button
className="path-button"
type="button"
disabled={!entry.extractable}
onClick={() => void showPreview(entry)}
>
{entry.path}
</button>
</th>
<td>{entry.kind}</td>
<td>{formatBytes(entry.size)}</td>
<td
title={entry.issues
.map((issue) => issue.message)
.join(" ")}
>
{entry.extractable
? "Safe file"
: entry.kind === "directory"
? "Directory"
: (entry.issues[0]?.message ?? "Blocked")}
</td>
</tr>
))}
</tbody>
</table>
</div>
{document.entries.length > ARCHIVE_LIMITS.maxDisplayedEntries ? (
<p className="policy-note">
Display capped at{" "}
{ARCHIVE_LIMITS.maxDisplayedEntries.toLocaleString()} entries;
use search to narrow the inventory.
</p>
) : null}
<div className="button-row action-row">
<button
className="primary-button"
type="button"
onClick={() => void extractSelection()}
disabled={!selected.size || busy}
>
Verify & download safe ZIP
</button>
<button
type="button"
onClick={() =>
downloadBlob(
new Blob([reportJson(document)], {
type: "application/json",
}),
`${outputStem(document.name)}-archive-report.json`,
)
}
>
Download report
</button>
</div>
</div>
<PreviewPane
entry={activeEntry}
preview={preview}
busy={previewBusy}
error={previewError}
/>
</div>
) : null}
</section>
);
}
function progressStatus(setStatus: (value: string) => void) {
return (update: ProgressUpdate) =>
setStatus(
`${update.stage}: ${update.completed.toLocaleString()} / ${update.total.toLocaleString()}`,
);
}
src/components/workspaces/PreviewPane.tsx
+70
View File
@@ -0,0 +1,70 @@
import { useEffect, useRef } from "react";
import type { ArchiveEntryRecord, PreviewResult } from "../../archive/types";
export function PreviewPane({
entry,
preview,
busy,
error,
}: {
entry?: ArchiveEntryRecord;
preview?: PreviewResult;
busy: boolean;
error?: string;
}) {
const image = useRef<HTMLImageElement>(null);
useEffect(() => {
const node = image.current;
if (!node || preview?.kind !== "image") return;
const url = URL.createObjectURL(preview.blob);
node.src = url;
return () => {
node.removeAttribute("src");
URL.revokeObjectURL(url);
};
}, [preview]);
return (
<aside className="preview-pane" aria-label="Entry preview">
<div className="panel-heading compact-heading">
<div>
<p className="eyebrow">Bounded preview</p>
<h3>{entry?.path ?? "Choose a file"}</h3>
</div>
{busy ? <span className="busy-dot">Reading…</span> : null}
</div>
{error ? (
<p className="status-message status-error" role="alert">
{error}
</p>
) : null}
{!preview && !error ? (
<p className="empty-state">
Text, bytes and static JPEG/PNG/WebP images can be previewed here.
</p>
) : null}
{preview?.note ? <p className="policy-note">{preview.note}</p> : null}
{preview?.kind === "text" ? (
<pre className="text-preview">{preview.text}</pre>
) : null}
{preview?.kind === "hex" ? (
<>
<pre className="hex-preview">{preview.text}</pre>
{preview.truncated ? (
<p className="policy-note">Hex preview truncated.</p>
) : null}
</>
) : null}
{preview?.kind === "image" ? (
<figure className="image-preview">
<img
ref={image}
alt={`Preview of ${entry?.path ?? "archive image"}`}
/>
<figcaption>
{preview.width} × {preview.height} · {preview.mimeType}
</figcaption>
</figure>
) : null}
</aside>
);
}
src/components/workspaces/StatusMessage.tsx
+21
View File
@@ -0,0 +1,21 @@
export function StatusMessage({
error,
status,
}: {
error?: string;
status?: string;
}) {
if (error)
return (
<p className="status-message status-error" role="alert">
{error}
</p>
);
if (status)
return (
<p className="status-message" role="status">
{status}
</p>
);
return null;
}
src/main.tsx
+18
View File
@@ -0,0 +1,18 @@
import { StrictMode } from "react";
import { createRoot } from "react-dom/client";
import { App } from "./App";
createRoot(document.getElementById("root")!).render(
<StrictMode>
<App />
</StrictMode>,
);
if ("serviceWorker" in navigator && import.meta.env.PROD) {
window.addEventListener("load", () => {
const url = new URL("./sw.js", document.baseURI);
void navigator.serviceWorker
.register(url, { scope: new URL("./", document.baseURI).pathname })
.catch(() => undefined);
});
}
src/styles.css
+608
View File
@@ -0,0 +1,608 @@
:root {
--toolbox-background: #f6f7fb;
--toolbox-surface: #fff;
--toolbox-surface-soft: #eff1f7;
--toolbox-text: #202332;
--toolbox-muted: #656b7d;
--toolbox-border: #d9dce7;
--toolbox-accent: #5b4ec4;
--toolbox-accent-hover: #493caf;
--toolbox-accent-soft: #ece9ff;
--toolbox-accent-contrast: #fff;
--toolbox-focus: #137d75;
--toolbox-danger: #b42342;
--toolbox-danger-soft: #fff0f3;
--toolbox-success: #167558;
--toolbox-warning: #995f00;
}
* {
box-sizing: border-box;
}
html {
min-width: 20rem;
min-height: 100%;
background: var(--toolbox-background);
scrollbar-gutter: stable;
}
body {
min-width: 20rem;
min-height: 100vh;
margin: 0;
background: var(--toolbox-background);
color: var(--toolbox-text);
font-family: Inter, ui-sans-serif, system-ui, sans-serif;
}
button,
input,
select,
textarea {
font: inherit;
}
button,
.button {
min-height: 2.55rem;
display: inline-flex;
align-items: center;
justify-content: center;
gap: 0.4rem;
padding: 0.55rem 0.8rem;
border: 1px solid var(--toolbox-border);
border-radius: 0.65rem;
background: var(--toolbox-surface);
color: var(--toolbox-text);
font-weight: 720;
cursor: pointer;
text-decoration: none;
}
button:hover:not(:disabled),
.button:hover {
border-color: var(--toolbox-accent);
background: var(--toolbox-surface-soft);
}
button:disabled {
cursor: not-allowed;
opacity: 0.5;
}
:where(button, input, select, textarea, a):focus-visible {
outline: 3px solid color-mix(in srgb, var(--toolbox-focus) 42%, transparent);
outline-offset: 2px;
}
input,
select,
textarea {
width: 100%;
min-height: 2.55rem;
padding: 0.58rem 0.7rem;
border: 1px solid var(--toolbox-border);
border-radius: 0.62rem;
background: var(--toolbox-surface);
color: var(--toolbox-text);
}
input[type="checkbox"] {
width: 1rem;
min-height: 1rem;
accent-color: var(--toolbox-accent);
}
.toolbox-shell__main {
width: min(100%, 90rem);
padding: clamp(0.75rem, 1.8vw, 1.5rem);
}
.workbench {
display: grid;
gap: 1rem;
}
.hero,
.panel {
border: 1px solid var(--toolbox-border);
border-radius: 0.9rem;
background: var(--toolbox-surface);
box-shadow: 0 8px 28px rgb(30 36 70 / 4%);
}
.hero {
display: flex;
justify-content: space-between;
gap: 1rem;
align-items: flex-start;
padding: clamp(1.1rem, 3vw, 2rem);
}
.hero h1,
.panel h2,
.panel h3,
.help-dialog :is(h2, h3),
.fatal h1 {
margin: 0;
letter-spacing: -0.025em;
}
.hero p:not(.eyebrow) {
max-width: 52rem;
margin: 0.55rem 0 0;
color: var(--toolbox-muted);
line-height: 1.55;
}
.eyebrow {
margin: 0 0 0.3rem;
color: var(--toolbox-accent);
font-size: 0.69rem;
font-weight: 820;
letter-spacing: 0.115em;
text-transform: uppercase;
}
.privacy-pill {
flex: 0 0 auto;
padding: 0.38rem 0.62rem;
border-radius: 999px;
background: var(--toolbox-accent-soft);
color: var(--toolbox-accent);
font-size: 0.75rem;
font-weight: 760;
}
.panel {
padding: clamp(0.85rem, 2vw, 1.25rem);
}
.workspace-panel {
min-height: 32rem;
}
.panel-heading {
display: flex;
justify-content: space-between;
gap: 1rem;
align-items: end;
margin-bottom: 0.9rem;
}
.compact-heading {
align-items: start;
}
.compact-heading h3 {
max-width: 30rem;
overflow-wrap: anywhere;
}
.workspace-tabs {
display: flex;
gap: 0.4rem;
overflow-x: auto;
padding: 0.15rem;
}
.workspace-tabs button {
white-space: nowrap;
}
.workspace-tabs button[aria-selected="true"] {
border-color: var(--toolbox-accent);
background: var(--toolbox-accent);
color: var(--toolbox-accent-contrast);
}
.primary-button {
border-color: var(--toolbox-accent);
background: var(--toolbox-accent);
color: var(--toolbox-accent-contrast);
}
.primary-button:hover:not(:disabled) {
border-color: var(--toolbox-accent-hover);
background: var(--toolbox-accent-hover);
}
.button-row {
display: flex;
flex-wrap: wrap;
gap: 0.5rem;
align-items: center;
}
.action-row {
margin-top: 0.85rem;
}
.field {
display: grid;
gap: 0.35rem;
}
.field > span {
font-size: 0.76rem;
font-weight: 750;
}
.field-grid,
.compare-inputs {
display: grid;
grid-template-columns: repeat(2, minmax(0, 1fr));
gap: 0.75rem;
}
.form-stack {
display: grid;
align-content: start;
gap: 0.85rem;
}
.policy-note {
margin: 0.55rem 0;
color: var(--toolbox-muted);
font-size: 0.82rem;
line-height: 1.48;
}
.status-message {
margin: 0.7rem 0;
padding: 0.68rem 0.75rem;
border: 1px solid
color-mix(in srgb, var(--toolbox-accent) 35%, var(--toolbox-border));
border-radius: 0.65rem;
background: var(--toolbox-accent-soft);
line-height: 1.4;
}
.status-error {
border-color: color-mix(
in srgb,
var(--toolbox-danger) 40%,
var(--toolbox-border)
);
background: var(--toolbox-danger-soft);
color: var(--toolbox-danger);
}
.danger-text {
color: var(--toolbox-danger);
}
.busy-dot {
flex: 0 0 auto;
color: var(--toolbox-accent);
font-size: 0.78rem;
font-weight: 750;
}
.drop-prompt {
min-height: 16rem;
display: grid;
place-content: center;
justify-items: center;
gap: 0.35rem;
padding: 2rem;
border: 2px dashed var(--toolbox-border);
border-radius: 0.8rem;
background: var(--toolbox-surface-soft);
text-align: center;
}
.drop-prompt span {
max-width: 34rem;
color: var(--toolbox-muted);
line-height: 1.5;
}
.archive-summary {
margin: 0.8rem 0 1rem;
padding: 0.8rem;
border: 1px solid var(--toolbox-border);
border-radius: 0.75rem;
background: var(--toolbox-surface-soft);
}
.archive-summary dl {
display: grid;
grid-template-columns: repeat(6, minmax(0, 1fr));
gap: 0.5rem;
margin: 0;
}
.archive-summary dl div {
min-width: 0;
padding: 0.55rem;
border-radius: 0.55rem;
background: var(--toolbox-surface);
}
.archive-summary dt {
color: var(--toolbox-muted);
font-size: 0.69rem;
font-weight: 750;
text-transform: uppercase;
}
.archive-summary dd {
margin: 0.25rem 0 0;
font-weight: 760;
overflow-wrap: anywhere;
}
.inspect-layout {
display: grid;
grid-template-columns: minmax(0, 1.55fr) minmax(18rem, 0.75fr);
gap: 0.85rem;
align-items: start;
}
.inventory-pane,
.preview-pane,
.file-selection-summary {
min-width: 0;
border: 1px solid var(--toolbox-border);
border-radius: 0.78rem;
background: var(--toolbox-surface);
}
.inventory-pane {
padding: 0.75rem;
}
.inventory-toolbar {
display: grid;
grid-template-columns: minmax(12rem, 1fr) minmax(9rem, 0.35fr);
gap: 0.6rem;
}
.selection-toolbar {
display: flex;
flex-wrap: wrap;
align-items: center;
gap: 0.45rem;
margin: 0.65rem 0;
}
.selection-toolbar span {
margin-inline-start: auto;
color: var(--toolbox-muted);
font-size: 0.8rem;
font-weight: 700;
}
.table-scroll {
max-width: 100%;
overflow: auto;
border: 1px solid var(--toolbox-border);
border-radius: 0.65rem;
}
.entry-table {
width: 100%;
border-collapse: collapse;
font-size: 0.78rem;
}
.entry-table th,
.entry-table td {
padding: 0.52rem 0.58rem;
border-bottom: 1px solid var(--toolbox-border);
text-align: start;
vertical-align: middle;
}
.entry-table thead th {
position: sticky;
top: 0;
z-index: 1;
background: var(--toolbox-surface-soft);
color: var(--toolbox-muted);
font-size: 0.68rem;
letter-spacing: 0.04em;
text-transform: uppercase;
}
.entry-table tbody tr:last-child :is(th, td) {
border-bottom: 0;
}
.entry-table tbody tr:hover {
background: color-mix(in srgb, var(--toolbox-accent-soft) 45%, transparent);
}
.blocked-row {
background: color-mix(in srgb, var(--toolbox-danger-soft) 65%, transparent);
}
.path-button {
min-height: 1.85rem;
max-width: 26rem;
justify-content: start;
padding: 0.2rem 0.35rem;
border: 0;
background: transparent;
color: var(--toolbox-accent);
font-size: inherit;
text-align: start;
overflow-wrap: anywhere;
}
.path-button:hover:not(:disabled) {
background: var(--toolbox-accent-soft);
}
.path-button:disabled {
color: var(--toolbox-muted);
opacity: 1;
}
.preview-pane {
position: sticky;
top: 0.75rem;
max-height: min(46rem, calc(100vh - 7rem));
padding: 0.8rem;
overflow: auto;
}
.empty-state {
min-height: 12rem;
display: grid;
place-content: center;
margin: 0;
padding: 1rem;
color: var(--toolbox-muted);
text-align: center;
line-height: 1.5;
}
.text-preview,
.hex-preview {
max-height: 34rem;
margin: 0.5rem 0 0;
padding: 0.75rem;
overflow: auto;
border-radius: 0.6rem;
background: #171923;
color: #f2f3f9;
font:
0.74rem/1.5 ui-monospace,
SFMono-Regular,
Consolas,
monospace;
white-space: pre-wrap;
overflow-wrap: anywhere;
}
.hex-preview {
white-space: pre;
}
.image-preview {
display: grid;
gap: 0.5rem;
margin: 0.5rem 0 0;
}
.image-preview img {
display: block;
max-width: 100%;
max-height: 32rem;
margin: auto;
object-fit: contain;
border: 1px solid var(--toolbox-border);
border-radius: 0.55rem;
background: repeating-conic-gradient(#ddd 0 25%, #fff 0 50%) 50% / 1rem 1rem;
}
.image-preview figcaption {
color: var(--toolbox-muted);
font-size: 0.76rem;
text-align: center;
}
.create-grid {
display: grid;
grid-template-columns: minmax(0, 1.3fr) minmax(17rem, 0.7fr);
gap: 0.9rem;
}
.file-selection-summary {
padding: 0.85rem;
background: var(--toolbox-surface-soft);
}
.file-selection-summary > p {
margin: 0.55rem 0;
}
.file-selection-summary ul {
max-height: 24rem;
margin: 0.75rem 0 0;
padding: 0;
overflow: auto;
list-style: none;
}
.file-selection-summary li {
display: flex;
justify-content: space-between;
gap: 0.7rem;
padding: 0.42rem 0.1rem;
border-bottom: 1px solid var(--toolbox-border);
font-size: 0.78rem;
}
.file-selection-summary li span:first-child {
min-width: 0;
overflow-wrap: anywhere;
}
.file-selection-summary li span:last-child {
flex: 0 0 auto;
color: var(--toolbox-muted);
}
.comparison-results {
display: grid;
gap: 0.65rem;
margin-top: 0.9rem;
}
.check-label {
display: inline-flex;
align-items: center;
gap: 0.45rem;
width: fit-content;
font-size: 0.82rem;
font-weight: 700;
}
.compare-state {
display: inline-flex;
padding: 0.23rem 0.4rem;
border-radius: 999px;
background: var(--toolbox-surface-soft);
font-size: 0.68rem;
font-weight: 800;
text-transform: uppercase;
}
.state-changed,
.state-type-changed {
background: #fff2d9;
color: var(--toolbox-warning);
}
.state-only-left,
.state-only-right {
background: var(--toolbox-danger-soft);
color: var(--toolbox-danger);
}
.state-same {
background: #e5f8ef;
color: var(--toolbox-success);
}
.loading,
.fatal {
width: min(100% - 2rem, 60rem);
margin: 2rem auto;
padding: 1rem;
}
.help-dialog {
width: min(42rem, calc(100% - 2rem));
max-height: calc(100vh - 2rem);
padding: 1.15rem;
overflow: auto;
border: 1px solid var(--toolbox-border);
border-radius: 0.9rem;
background: var(--toolbox-surface);
color: var(--toolbox-text);
}
.help-dialog::backdrop {
background: rgb(20 24 45 / 55%);
}
.dialog-heading {
display: flex;
justify-content: space-between;
gap: 1rem;
align-items: start;
}
.help-copy {
color: var(--toolbox-muted);
line-height: 1.55;
}
.help-copy h3 {
margin-top: 1.1rem;
color: var(--toolbox-text);
font-size: 1rem;
}
.visually-hidden {
position: absolute !important;
width: 1px !important;
height: 1px !important;
padding: 0 !important;
margin: -1px !important;
overflow: hidden !important;
clip: rect(0 0 0 0) !important;
white-space: nowrap !important;
border: 0 !important;
}
@media (max-width: 70rem) {
.archive-summary dl {
grid-template-columns: repeat(3, minmax(0, 1fr));
}
.inspect-layout {
grid-template-columns: 1fr;
}
.preview-pane {
position: static;
max-height: none;
}
}
@media (max-width: 48rem) {
.hero {
flex-direction: column;
}
.privacy-pill {
order: -1;
}
.panel-heading {
align-items: start;
flex-direction: column;
}
.inventory-toolbar,
.field-grid,
.compare-inputs,
.create-grid {
grid-template-columns: 1fr;
}
.archive-summary dl {
grid-template-columns: repeat(2, minmax(0, 1fr));
}
.entry-table {
min-width: 42rem;
}
}
@media (prefers-reduced-motion: reduce) {
*,
*::before,
*::after {
scroll-behavior: auto !important;
transition-duration: 0.01ms !important;
animation-duration: 0.01ms !important;
animation-iteration-count: 1 !important;
}
}
src/test/setup.ts
+8
View File
@@ -0,0 +1,8 @@
import "@testing-library/jest-dom/vitest";
import { afterEach } from "vitest";
import { cleanup } from "@testing-library/react";
afterEach(() => {
cleanup();
if (typeof localStorage !== "undefined") localStorage.clear();
});
src/toolbox/manifest.source.json
+41
View File
@@ -0,0 +1,41 @@
{
"$schema": "https://git.add-ideas.de/lotobo/toolbox-sdk/raw/branch/main/schemas/toolbox-app.v1.schema.json",
"schemaVersion": 1,
"id": "de.add-ideas.archive-tools",
"name": "Archive Tools",
"version": "0.1.0",
"description": "Inspect, create, compare and safely extract archives locally.",
"entry": "./",
"icon": "./favicon.svg",
"categories": ["files", "archives", "developer"],
"tags": ["zip", "tar", "gzip", "extract", "archive"],
"integration": {
"contextVersion": 1,
"launchModes": ["navigate", "new-tab"],
"embedding": "unsupported"
},
"requirements": {
"secureContext": false,
"workers": false,
"indexedDb": false,
"crossOriginIsolated": false,
"topLevelContext": false
},
"privacy": {
"processing": "local",
"fileUploads": false,
"telemetry": false,
"label": "Inputs stay in this browser; nothing is uploaded."
},
"source": {
"repository": "https://git.add-ideas.de/lotobo/archive-tools",
"license": "GPL-3.0-or-later"
},
"actions": [
{
"id": "source",
"label": "Source",
"url": "https://git.add-ideas.de/lotobo/archive-tools"
}
]
}
src/toolbox/manifest.ts
+4
View File
@@ -0,0 +1,4 @@
import { defineToolboxApp, parseToolboxApp } from "@add-ideas/toolbox-contract";
import source from "./manifest.source.json";
export const manifest = defineToolboxApp(parseToolboxApp(source));
src/version.ts
+1
View File
@@ -0,0 +1 @@
export const APP_VERSION = "0.1.0";
src/vite-env.d.ts
Vendored
+1
View File
@@ -0,0 +1 @@
/// <reference types="vite/client" />
tests/archive/paths.test.ts
+33
View File
@@ -0,0 +1,33 @@
// @vitest-environment node
import { describe, expect, it } from "vitest";
import { assessArchivePath } from "../../src/archive/paths";
describe("archive path policy", () => {
it.each([
"../escape.txt",
"/absolute.txt",
"C:/drive.txt",
"safe/../../escape",
"CON",
"file.txt:stream",
"trailing. ",
"invoice\u202egnp.exe",
])("blocks unsafe path %s", (path) =>
expect(assessArchivePath(path).safe).toBe(false),
);
it("normalizes Unicode and treats backslashes as cross-platform separators", () => {
const result = assessArchivePath("Folder\\cafe\u0301.txt");
expect(result.normalized).toBe("Folder/café.txt");
expect(result.safe).toBe(true);
expect(result.issues.map((issue) => issue.code)).toContain(
"BACKSLASH_PATH",
);
});
it("produces a conservative case-insensitive collision key", () => {
expect(assessArchivePath("Folder/Report.TXT").collisionKey).toBe(
assessArchivePath("folder/report.txt").collisionKey,
);
});
});
tests/archive/preview.test.ts
+119
View File
@@ -0,0 +1,119 @@
// @vitest-environment node
import { File as NodeFile } from "node:buffer";
import { describe, expect, it } from "vitest";
import { previewEntry } from "../../src/archive/preview";
import type {
ArchiveDocument,
ArchiveEntryRecord,
} from "../../src/archive/types";
describe("bounded previews", () => {
it("returns a safe static PNG Blob only after dimension inspection", async () => {
const png = Uint8Array.from(
Buffer.from(
"iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAQAAAC1HAwCAAAAC0lEQVR42mNk+A8AAQUBAScY42YAAAAASUVORK5CYII=",
"base64",
),
);
await expect(previewFixture("pixel.png", png)).resolves.toMatchObject({
kind: "image",
mimeType: "image/png",
width: 1,
height: 1,
});
});
it("refuses animated PNG previews before browser decoding", async () => {
const png = Uint8Array.from(
Buffer.from(
"iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAQAAAC1HAwCAAAAC0lEQVR42mNk+A8AAQUBAScY42YAAAAASUVORK5CYII=",
"base64",
),
);
const idat = findChunk(png, "IDAT");
const actl = new Uint8Array([
0, 0, 0, 8, 0x61, 0x63, 0x54, 0x4c, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0,
]);
const animated = new Uint8Array(png.length + actl.length);
animated.set(png.subarray(0, idat), 0);
animated.set(actl, idat);
animated.set(png.subarray(idat), idat + actl.length);
await expect(previewFixture("animated.png", animated)).rejects.toThrow(
/Animated/iu,
);
});
it("supports a bounded VP8X WebP inventory without interpreting active content", async () => {
const webp = new Uint8Array(30);
webp.set(new TextEncoder().encode("RIFF"), 0);
new DataView(webp.buffer).setUint32(4, 22, true);
webp.set(new TextEncoder().encode("WEBPVP8X"), 8);
new DataView(webp.buffer).setUint32(16, 10, true);
webp[24] = 2;
webp[27] = 3;
await expect(previewFixture("sample.webp", webp)).resolves.toMatchObject({
kind: "image",
width: 3,
height: 4,
mimeType: "image/webp",
});
});
it("shows nested archives as bytes without recursive expansion", async () => {
const nested = new Uint8Array([0x50, 0x4b, 0x03, 0x04, 1, 2, 3]);
await expect(previewFixture("nested.zip", nested)).resolves.toMatchObject({
kind: "hex",
note: expect.stringMatching(/Nested archive expansion/iu),
});
});
});
function documentFor(path: string, payload: Uint8Array): ArchiveDocument {
const entry: ArchiveEntryRecord = {
id: "0",
sourceIndex: 0,
rawPath: path,
path,
collisionKey: path.toLocaleLowerCase("en-US"),
kind: "file",
size: payload.length,
extractable: true,
issues: [],
dataOffset: 0,
};
return {
name: "fixture.gz",
format: "gzip",
source: new NodeFile(
[Buffer.from(payload)],
"fixture.gz",
) as unknown as File,
sourceBytes: payload.length,
entries: [entry],
issues: [],
expandedBytes: payload.length,
compressedBytes: payload.length,
zip64: false,
payload,
};
}
function previewFixture(path: string, payload: Uint8Array) {
const document = documentFor(path, payload);
return previewEntry(document, document.entries[0]!);
}
function findChunk(bytes: Uint8Array, type: string): number {
const expected = new TextEncoder().encode(type);
for (let offset = 8; offset + 8 <= bytes.length;) {
if (expected.every((value, index) => bytes[offset + 4 + index] === value))
return offset;
const length = new DataView(
bytes.buffer,
bytes.byteOffset + offset,
4,
).getUint32(0);
offset += 12 + length;
}
throw new Error(`${type} chunk not found`);
}
tests/archive/tar-gzip.test.ts
+93
View File
@@ -0,0 +1,93 @@
// @vitest-environment node
import { File } from "node:buffer";
import { describe, expect, it } from "vitest";
import { gzipDeterministic, gunzipBounded } from "../../src/archive/gzip";
import { createTar, parseTar } from "../../src/archive/tar";
function input(path: string, text: string) {
return {
path,
file: new File(
[text],
path.split("/").at(-1)!,
) as unknown as globalThis.File,
};
}
describe("TAR, USTAR, PAX and gzip", () => {
it("creates deterministic TAR and parses regular entries", async () => {
const inputs = [input("b.txt", "second"), input("folder/a.txt", "first")];
const first = await createTar(inputs);
const second = await createTar(inputs);
expect(first).toEqual(second);
const parsed = parseTar(first);
expect(parsed.entries.map((entry) => entry.path)).toEqual([
"b.txt",
"folder/a.txt",
]);
expect(parsed.entries.every((entry) => entry.extractable)).toBe(true);
expect(parsed.entries[1]?.crc32).toBe("9271ee57");
});
it("round-trips a long path through a bounded PAX path header", async () => {
const longPath = `${"long-".repeat(24)}name.txt`;
const tar = await createTar([input(longPath, "PAX")]);
expect(parseTar(tar).entries[0]?.path).toBe(longPath);
});
it("lists but blocks symbolic links", async () => {
const tar = await createTar([input("link", "target")]);
tar[156] = 0x32;
rewriteChecksum(tar.subarray(0, 512));
const entry = parseTar(tar).entries[0]!;
expect(entry.kind).toBe("symlink");
expect(entry.extractable).toBe(false);
expect(entry.issues.map((issue) => issue.code)).toContain("SPECIAL_ENTRY");
});
it("rejects a damaged TAR header checksum", async () => {
const tar = await createTar([input("file.txt", "data")]);
tar[0] = tar[0]! ^ 1;
expect(() => parseTar(tar)).toThrow(/checksum/iu);
});
it("rejects ambiguous non-zero data after the TAR end marker", async () => {
const tar = await createTar([input("file.txt", "data")]);
const appended = new Uint8Array(tar.length + 1);
appended.set(tar);
appended[tar.length] = 1;
expect(() => parseTar(appended)).toThrow(/follows the TAR end/iu);
});
it("creates deterministic gzip and validates CRC and ISIZE", () => {
const source = new TextEncoder().encode("local archive payload");
const first = gzipDeterministic(source);
expect(first).toEqual(gzipDeterministic(source));
expect(gunzipBounded(first, 1024)).toEqual(source);
first[first.length - 8] = first[first.length - 8]! ^ 1;
expect(() => gunzipBounded(first, 1024)).toThrow(/CRC-32|footer/iu);
});
it("stops gzip expansion at the configured operation limit", () => {
const compressed = gzipDeterministic(new Uint8Array(32_768));
expect(() => gunzipBounded(compressed, 1024)).toThrow(/expanded-byte/iu);
});
it("explicitly rejects concatenated gzip members", () => {
const left = gzipDeterministic(new TextEncoder().encode("left"));
const right = gzipDeterministic(new TextEncoder().encode("right"));
const joined = new Uint8Array(left.length + right.length);
joined.set(left);
joined.set(right, left.length);
expect(() => gunzipBounded(joined, 1024)).toThrow(/multi-member/iu);
});
});
function rewriteChecksum(header: Uint8Array) {
header.fill(0x20, 148, 156);
const checksum = header.reduce((sum, byte) => sum + byte, 0);
const text = checksum.toString(8).padStart(6, "0");
header.set(new TextEncoder().encode(text), 148);
header[154] = 0;
header[155] = 0x20;
}
tests/archive/zip-service.test.ts
+193
View File
@@ -0,0 +1,193 @@
// @vitest-environment node
import { File as NodeFile } from "node:buffer";
import { BlobReader, BlobWriter, TextReader, ZipWriter } from "@zip.js/zip.js";
import { describe, expect, it } from "vitest";
import { compareArchives } from "../../src/archive/compare";
import { previewEntry } from "../../src/archive/preview";
import {
createArchive,
createSafeSelectionZip,
inspectArchive,
readEntryBytes,
} from "../../src/archive/service";
const asFile = (
parts: ConstructorParameters<typeof NodeFile>[0],
name: string,
type = "application/octet-stream",
) => new NodeFile(parts, name, { type }) as unknown as globalThis.File;
describe("ZIP inspection and safe workflows", () => {
it("creates byte-deterministic ZIPs, reads CRC-checked content and previews text", async () => {
const files = [
asFile(["hello"], "hello.txt"),
asFile(["world"], "world.txt"),
];
const first = await createArchive(files, "zip");
const second = await createArchive(files, "zip");
expect(new Uint8Array(await first.arrayBuffer())).toEqual(
new Uint8Array(await second.arrayBuffer()),
);
const document = await inspectArchive(
asFile([await first.arrayBuffer()], "sample.zip"),
);
expect(document.entries).toHaveLength(2);
expect(document.entries.every((entry) => entry.extractable)).toBe(true);
const bytes = await readEntryBytes(document, document.entries[0]!, 1024);
expect(new TextDecoder().decode(bytes)).toBe("hello");
await expect(
previewEntry(document, document.entries[0]!),
).resolves.toMatchObject({ kind: "text", text: "hello" });
});
it("blocks traversal, case-colliding and encrypted entries at inspection", async () => {
const blobWriter = new BlobWriter("application/zip");
const writer = new ZipWriter(blobWriter, { useWebWorkers: false });
await writer.add("../escape.txt", new TextReader("bad"), {
useWebWorkers: false,
});
await writer.add("Report.txt", new TextReader("one"), {
useWebWorkers: false,
});
await writer.add("report.TXT", new TextReader("two"), {
useWebWorkers: false,
});
await writer.add("secret.txt", new TextReader("secret"), {
password: "test-password",
useWebWorkers: false,
});
const blob = await writer.close();
const document = await inspectArchive(
asFile([await blob.arrayBuffer()], "unsafe.zip"),
);
expect(document.entries[0]?.issues.map((issue) => issue.code)).toContain(
"PATH_TRAVERSAL",
);
expect(document.entries[2]?.issues.map((issue) => issue.code)).toContain(
"DUPLICATE_PATH",
);
expect(document.entries[3]?.issues.map((issue) => issue.code)).toContain(
"ENCRYPTED_ENTRY",
);
expect(document.entries.filter((entry) => entry.extractable)).toEqual([]);
});
it("enforces compression-ratio policy before decompression", async () => {
const blob = await createArchive(
[asFile([new Uint8Array(1024 * 1024)], "zeros.bin")],
"zip",
);
const document = await inspectArchive(
asFile([await blob.arrayBuffer()], "ratio.zip"),
);
expect(document.entries[0]?.extractable).toBe(false);
expect(document.entries[0]?.issues.map((issue) => issue.code)).toContain(
"COMPRESSION_RATIO",
);
});
it("detects stored-entry corruption when content is requested", async () => {
const writer = new ZipWriter(new BlobWriter("application/zip"), {
level: 0,
useWebWorkers: false,
});
await writer.add("hello.txt", new TextReader("hello"), {
level: 0,
useWebWorkers: false,
});
const blob = await writer.close();
const bytes = new Uint8Array(await blob.arrayBuffer());
const nameLength = bytes[26]! | (bytes[27]! << 8);
const extraLength = bytes[28]! | (bytes[29]! << 8);
bytes[30 + nameLength + extraLength] =
bytes[30 + nameLength + extraLength]! ^ 1;
const document = await inspectArchive(asFile([bytes], "corrupt.zip"));
await expect(
readEntryBytes(document, document.entries[0]!, 1024),
).rejects.toThrow();
});
it("repackages only a verified selection into a fresh safe ZIP", async () => {
const original = await createArchive(
[asFile(["one"], "one.txt"), asFile(["two"], "two.txt")],
"zip",
);
const document = await inspectArchive(
asFile([await original.arrayBuffer()], "original.zip"),
);
const safe = await createSafeSelectionZip(document, [
document.entries[1]!.id,
]);
const repackaged = await inspectArchive(
asFile([await safe.arrayBuffer()], "safe.zip"),
);
expect(repackaged.entries.map((entry) => entry.path)).toEqual(["two.txt"]);
expect(
new TextDecoder().decode(
await readEntryBytes(repackaged, repackaged.entries[0]!, 1024),
),
).toBe("two");
});
it("compares archive content independent of container format", async () => {
const leftBlob = await createArchive(
[asFile(["same"], "same.txt"), asFile(["old"], "changed.txt")],
"zip",
);
const rightBlob = await createArchive(
[asFile(["same"], "same.txt"), asFile(["new"], "changed.txt")],
"tar",
);
const left = await inspectArchive(
asFile([await leftBlob.arrayBuffer()], "left.zip"),
);
const right = await inspectArchive(
asFile([await rightBlob.arrayBuffer()], "right.tar"),
);
expect(
compareArchives(left, right).map(({ path, status }) => ({
path,
status,
})),
).toEqual([
{ path: "changed.txt", status: "changed" },
{ path: "same.txt", status: "same" },
]);
});
it("reads a ZIP produced externally through a BlobReader", async () => {
const writer = new ZipWriter(new BlobWriter("application/zip"), {
useWebWorkers: false,
});
await writer.add(
"folder/data.bin",
new BlobReader(new Blob([new Uint8Array([0, 1, 2, 3])])),
{ useWebWorkers: false },
);
const document = await inspectArchive(
asFile([await (await writer.close()).arrayBuffer()], "external.zip"),
);
expect(document.entries[0]).toMatchObject({
path: "folder/data.bin",
size: 4,
compression: "deflate",
});
});
it("recognizes ZIP64 metadata without requiring a multi-gigabyte fixture", async () => {
const writer = new ZipWriter(new BlobWriter("application/zip"), {
useWebWorkers: false,
zip64: true,
});
await writer.add("zip64.txt", new TextReader("small fixture"), {
useWebWorkers: false,
zip64: true,
});
const document = await inspectArchive(
asFile([await (await writer.close()).arrayBuffer()], "forced-zip64.zip"),
);
expect(document.zip64).toBe(true);
expect(document.entries[0]?.zip64).toBe(true);
});
});
tests/browser/app.spec.ts
+158
View File
@@ -0,0 +1,158 @@
import { expect, test, type Page } from "@playwright/test";
import { Buffer } from "node:buffer";
import { strToU8, zipSync } from "fflate";
const ORIGIN = "http://127.0.0.1:4173";
async function localOnly(page: Page) {
const external: string[] = [];
await page.route("**/*", async (route) => {
const url = new URL(route.request().url());
if (url.origin !== ORIGIN) {
external.push(url.href);
await route.abort();
} else await route.continue();
});
return external;
}
test("runs from a nested path without external requests", async ({ page }) => {
const errors: string[] = [];
page.on("pageerror", (error) => errors.push(error.message));
page.on("console", (message) => {
if (message.type() === "error") errors.push(message.text());
});
const external = await localOnly(page);
await page.goto("/deep/nested/archive/");
await expect(
page.getByRole("heading", { name: "Archive Tools" }),
).toBeVisible();
expect(external).toEqual([]);
expect(errors).toEqual([]);
});
test("serves the release identity and hardened headers", async ({
request,
}) => {
const index = await request.get("/deep/nested/archive/");
expect(index.ok()).toBe(true);
expect(index.headers()["content-security-policy"]).toContain(
"default-src 'self'",
);
expect(await index.text()).not.toMatch(/\b(?:src|href)=["']\//u);
const manifest = await request.get("/deep/nested/archive/toolbox-app.json");
await expect(manifest.json()).resolves.toMatchObject({
id: "de.add-ideas.archive-tools",
version: "0.1.0",
entry: "./",
requirements: { workers: false },
});
});
test("inspects, previews and safely repackages a ZIP locally", async ({
page,
}) => {
const external = await localOnly(page);
await page.goto("/deep/nested/archive/");
const archive = zipSync({
"hello.txt": strToU8("Hello from a local ZIP"),
"folder/data.bin": new Uint8Array([0, 1, 2, 3]),
});
await page.getByLabel("Choose archive").setInputFiles({
name: "sample.zip",
mimeType: "application/zip",
buffer: Buffer.from(archive),
});
await expect(page.getByText("Inspected 2 entries locally.")).toBeVisible();
await expect(page.getByRole("button", { name: "hello.txt" })).toBeVisible();
await page.getByRole("button", { name: "hello.txt" }).click();
await expect(page.getByText("Hello from a local ZIP")).toBeVisible();
await page.getByRole("checkbox", { name: "Select hello.txt" }).check();
const downloadPromise = page.waitForEvent("download");
await page
.getByRole("button", { name: "Verify & download safe ZIP" })
.click();
expect((await downloadPromise).suggestedFilename()).toBe(
"sample-safe-selection.zip",
);
expect(external).toEqual([]);
});
test("blocks traversal and case-colliding ZIP paths", async ({ page }) => {
await page.goto("/deep/nested/archive/");
const archive = zipSync({
"../escape.txt": strToU8("bad"),
"Report.txt": strToU8("one"),
"report.TXT": strToU8("two"),
});
await page.getByLabel("Choose archive").setInputFiles({
name: "unsafe.zip",
mimeType: "application/zip",
buffer: Buffer.from(archive),
});
await expect(
page.getByText("Parent-directory path segments are blocked."),
).toBeVisible();
await expect(page.getByText(/Path collides with entry/u)).toHaveCount(2);
await expect(
page.getByRole("checkbox", { name: "Select escape.txt" }),
).toBeDisabled();
await expect(
page.getByRole("checkbox", { name: "Select Report.txt", exact: true }),
).toBeDisabled();
});
test("creates a TAR and compares archive inventories", async ({ page }) => {
await page.goto("/deep/nested/archive/");
await page.getByRole("button", { name: "Create" }).click();
await page.getByLabel("Files").setInputFiles([
{
name: "alpha.txt",
mimeType: "text/plain",
buffer: Buffer.from("alpha"),
},
{
name: "beta.txt",
mimeType: "text/plain",
buffer: Buffer.from("beta"),
},
]);
await page.getByLabel("Output name").fill("browser-created");
await page.getByLabel("Format").selectOption("tar");
const createdPromise = page.waitForEvent("download");
await page.getByRole("button", { name: "Create & download" }).click();
const created = await createdPromise;
expect(created.suggestedFilename()).toBe("browser-created.tar");
await page.getByRole("button", { name: "Inspect & extract" }).click();
await page.getByLabel("Choose archive").setInputFiles(await created.path());
await expect(page.getByText("Inspected 2 entries locally.")).toBeVisible();
await page.getByRole("button", { name: "Compare" }).click();
const left = zipSync({
"same.txt": strToU8("same"),
"changed.txt": strToU8("old"),
});
const right = zipSync({
"same.txt": strToU8("same"),
"changed.txt": strToU8("new"),
});
await page.getByLabel("Left archive").setInputFiles({
name: "left.zip",
mimeType: "application/zip",
buffer: Buffer.from(left),
});
await page.getByLabel("Right archive").setInputFiles({
name: "right.zip",
mimeType: "application/zip",
buffer: Buffer.from(right),
});
await page.getByRole("button", { name: "Compare locally" }).click();
await expect(
page.getByRole("row", { name: /changed\.txt changed/u }),
).toBeVisible();
await expect(page.getByRole("row", { name: /same\.txt/u })).toHaveCount(0);
await page.getByRole("checkbox", { name: "Show changes only" }).uncheck();
await expect(
page.getByRole("row", { name: /same\.txt same/u }),
).toBeVisible();
});
tests/components/app.test.tsx
+17
View File
@@ -0,0 +1,17 @@
import { render, screen } from "@testing-library/react";
import { describe, expect, it, vi } from "vitest";
import { App } from "../../src/App";
describe("Archive Tools", () => {
it("renders the local workbench and standard shell", async () => {
vi.stubGlobal(
"fetch",
vi.fn(async () => new Response("Not found", { status: 404 })),
);
render(<App />);
expect(
await screen.findByRole("heading", { name: "Archive Tools" }),
).toBeVisible();
expect(await screen.findByText("Browser-local")).toBeVisible();
});
});
tsconfig.app.json
+27
View File
@@ -0,0 +1,27 @@
{
"compilerOptions": {
"tsBuildInfoFile": "./node_modules/.tmp/tsconfig.app.tsbuildinfo",
"target": "ES2023",
"lib": ["ES2023", "DOM", "DOM.Iterable"],
"module": "ESNext",
"types": ["vite/client", "node"],
"allowArbitraryExtensions": true,
"skipLibCheck": true,
"moduleResolution": "Bundler",
"allowImportingTsExtensions": true,
"verbatimModuleSyntax": true,
"moduleDetection": "force",
"noEmit": true,
"jsx": "react-jsx",
"noUnusedLocals": true,
"noUnusedParameters": true,
"erasableSyntaxOnly": true,
"noFallthroughCasesInSwitch": true,
"strict": true,
"noUncheckedIndexedAccess": true,
"useDefineForClassFields": true,
"resolveJsonModule": true,
"isolatedModules": true
},
"include": ["src", "tests"]
}
tsconfig.json
+11
View File
@@ -0,0 +1,11 @@
{
"files": [],
"references": [
{
"path": "./tsconfig.app.json"
},
{
"path": "./tsconfig.node.json"
}
]
}
tsconfig.node.json
+24
View File
@@ -0,0 +1,24 @@
{
"compilerOptions": {
"tsBuildInfoFile": "./node_modules/.tmp/tsconfig.node.tsbuildinfo",
"target": "ES2023",
"lib": ["ES2023"],
"module": "ESNext",
"types": ["node"],
"skipLibCheck": true,
"moduleResolution": "Bundler",
"allowImportingTsExtensions": true,
"verbatimModuleSyntax": true,
"moduleDetection": "force",
"noEmit": true,
"strict": true,
"noUnusedLocals": true,
"noUnusedParameters": true
},
"include": [
"vite.config.ts",
"playwright.config.ts",
"eslint.config.mjs",
"scripts/**/*.mjs"
]
}
vite.config.ts
+16
View File
@@ -0,0 +1,16 @@
/// <reference types="vitest/config" />
import { defineConfig } from "vite";
import react from "@vitejs/plugin-react";
export default defineConfig({
base: "./",
plugins: [react()],
test: {
environment: "jsdom",
setupFiles: "./src/test/setup.ts",
css: true,
maxWorkers: 2,
restoreMocks: true,
exclude: ["tests/browser/**", "node_modules/**", "dist/**"],
},
});