File _service:obs_scm:disko-san-1.2.obscpio of Package disko-san

Overview Repositories Revisions Requests Users Attributes Meta

File _service:obs_scm:disko-san-1.2.obscpio of Package disko-san

07070100000000000041ED000001D9000001DA00000003605C47BC00000000000000000000000000000000000000000000001600000000disko-san-1.2/.github07070100000001000041ED000001D9000001DA00000002605C47BC00000000000000000000000000000000000000000000002000000000disko-san-1.2/.github/workflows07070100000002000081A4000001D9000001DA00000001605C47BC00000256000000000000000000000000000000000000002F00000000disko-san-1.2/.github/workflows/disko-san.yaml---

name: disko-san
on: push

jobs:
  runtest:
    name: Run test
    runs-on: ubuntu-latest
    steps:
      - name: Checkout code
        uses: actions/checkout@v2
      - name: Setup go
        uses: actions/setup-go@v2
        with:
          go-version: '1.14'
      - name: Compile
        run: make
      - name: Prepare disk
        run: truncate img -s 20MB
      - name: Run disko-san
        run: ./disko-san img
      - name: Run disko-san with stats
        run: ./disko-san img stats
      - name: Run disko-san with stats and performance log
        run: ./disko-san img stats0 log
07070100000003000081A4000001D9000001DA00000001605C47BC000086A6000000000000000000000000000000000000001600000000disko-san-1.2/LICENSEGNU GENERAL PUBLIC LICENSE

Version 3, 29 June 2007

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.

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>.
07070100000004000081A4000001D9000001DA00000001605C47BC000000F7000000000000000000000000000000000000001700000000disko-san-1.2/Makefiledefault: all
all: disko-san

PREFIX=/usr/local/bin
GOARGS=

disko-san: cmd/disko-san/disko-san.go cmd/disko-san/chunk.go cmd/disko-san/disk.go cmd/disko-san/progress.go
	go build $(GOARGS) -o $@ $^

install: disko-san
	install disko-san $(PREFIX)
07070100000005000081A4000001D9000001DA00000001605C47BC000005EB000000000000000000000000000000000000001800000000disko-san-1.2/README.md# disko-san

`disko-san` is a simple tool to check the sanity of new hard drives.

The sanity check is done by first writing random data to the disk, which then is read and verified by validating checksum. Data is written as 4 MiB chunks, each sonsisting of a 4 byte checksum plus random data. The checksum allows the program, if the chunk is valid or if the data has been corrupted.

If provided with a STATE file, `disko-san` can stop and resume its operation afterwards. This is useful for large disks, where the host system requires to undergo a system reboot or any other kind of interruption. `disko-san` will be able to resume the process, where it was left before.

In addition, `disko-san` can log write performance metrics to a file. This PERFLOG can be used to check if the write performance of the disk remains stable throughout its capacity. This is useful to check for bad sectors, where the write performance might not be stable.

## Usage

disko-san DISK [STATE] [PERFLOG]
	
	  DISK          defines the disk under test
	  STATE         progress file, required for resume operations
	  PERFLOG       write performance (write metrics) to this file

## Building

`disko-san` is written in plain go without additional requirements

go build -o disko-san disko-san.go

or the lazy way

make

# Disclaimer

The software is provided as-is without any warranty of claims to be correct or even working at all. I'm a random dude from the internet, it's up to you to decide to trust me or not :-)07070100000006000041ED000001D9000001DA00000003605C47BC00000000000000000000000000000000000000000000001200000000disko-san-1.2/cmd07070100000007000041ED000001D9000001DA00000002605C47BC00000000000000000000000000000000000000000000001C00000000disko-san-1.2/cmd/disko-san07070100000008000081A4000001D9000001DA00000001605C47BC0000084D000000000000000000000000000000000000002500000000disko-san-1.2/cmd/disko-san/chunk.gopackage main

import (
	"crypto/rand"
	"fmt"
	"hash/crc32"
)

// Compute checksum of the given buffer
func checksum(buf []byte) uint32 {
	crc32q := crc32.MakeTable(0xD5828281)
	return crc32.Checksum(buf, crc32q)
}

// Check if the given chunk is OK
func VerifyChunk(buf []byte) bool {
	cSum := checksum(buf[4:])
	for i := 0; i < 4; i++ {
		if buf[i] != byte(cSum<<i) {
			return false
		}
	}
	return true
}

func CreateChunk(buf []byte) {
	n, err := rand.Read(buf[4:]) // don't waste the first four bytes, as they are anyways checksum
	if err != nil {
		// This error is critical and cannot be recovered
		panic(err)
	}
	if n < len(buf)-4 {
		panic(fmt.Errorf("couldn't get enough bytes from random pool"))
	}
	ApplyChecksum(buf)
}

func ApplyChecksum(buf []byte) {
	// Apply checksum to CHUNK at the beginning
	cSum := checksum(buf[4:])
	for i := 0; i < 4; i++ {
		buf[i] = byte(cSum << i)
	}
}

// Factory for producing chunks
type ChunkFactory struct {
	buf     []byte   // destination buffer
	sig     chan int // status channel
	running bool     // Running flag
}

func (cf *ChunkFactory) StartProduce(size int) {
	if cf.running {
		return
	}
	cf.buf = make([]byte, size)
	cf.sig = make(chan int, 1)
	cf.running = true
	go cf.produce()
}

func (cf *ChunkFactory) produce() {
	for cf.running {
		CreateChunk(cf.buf)
		cf.sig <- 0        // Send ready signal
		if <-cf.sig != 0 { // Wait for signal to proceed
			break // stop signal
		}
	}
}

func (cf *ChunkFactory) Read(buf []byte) error {
	if !cf.running {
		return fmt.Errorf("chunk factory not running")
	}
	// We can deal with smaller buffer sizes, but not with larger
	if len(cf.buf) < len(buf) {
		return fmt.Errorf("chunk factory buffer size mismatch")
	}
	// Wait for ready signal
	if sig := <-cf.sig; sig != 0 {
		return fmt.Errorf("chunk factory signal %d", sig)
	}
	copy(buf, cf.buf) // smaller buffer is allowed
	// If it is a smaller buffer, we need to re-compute the checksum
	if len(cf.buf) != len(buf) {
		ApplyChecksum(buf)
	}
	cf.sig <- 0
	return nil
}

func (cf *ChunkFactory) Stop() {
	if !cf.running {
		return
	}
	cf.running = false
	cf.sig <- 1
}
07070100000009000081A4000001D9000001DA00000001605C47BC00000E32000000000000000000000000000000000000002400000000disko-san-1.2/cmd/disko-san/disk.go/* Disk handling for disko-san */
package main

import (
	"fmt"
	"io"
	"os"
)

const CHUNKSIZE = 4 * 1024 * 1024                                // Chunk size is 4 MB
var DISKMAGIC = []byte{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 3, 3, 7} // DISK magic to make sure we are continuing on the right disk

func isDiskMagic(buf []byte) bool {
	n := len(DISKMAGIC)
	if len(buf) < n {
		return false
	}
	for i := 0; i < n; i++ {
		if buf[i] != DISKMAGIC[i] {
			return false
		}
	}
	return true
}

type Disk struct {
	path string   // access path for disk
	size int64    // disk size
	f    *os.File // file handle for disk
}

func CreateDisk(path string) Disk {
	return Disk{path: path}
}

func (d *Disk) Open() error {
	var err error
	if d.f, err = os.OpenFile(d.path, os.O_RDWR, 0640); err != nil {
		d.Close()
		return err
	}
	if d.size, err = d.getDiskSize(); err != nil {
		d.Close()
		return err
	}
	return nil
}
func (d *Disk) Close() error {
	if d.f != nil {
		err := d.f.Close()
		d.f = nil
		return err
	}
	return nil
}

func (d *Disk) seekWhence(whence int) (int64, error) {
	if d.f == nil {
		return 0, fmt.Errorf("disk not opened")
	}
	return d.f.Seek(0, whence)
}

func (d *Disk) Seek(pos int64) error {
	if d.f == nil {
		return fmt.Errorf("disk not opened")
	}
	if n, err := d.f.Seek(pos, 0); err != nil {
		return err
	} else if n != pos {
		fmt.Fprintf(os.Stderr, "Seek failed. Expected %d but got %d\n", pos, n)
		return fmt.Errorf("seek failed")
	}
	return nil
}

// Get current position on disk
func (d *Disk) Position() (int64, error) {
	// First get current position so we can restore that later
	return d.f.Seek(0, 1)
}

func (d *Disk) Size() int64 {
	return d.size
}

func (d *Disk) getDiskSize() (int64, error) {
	// determine size by seeking at the end of the file
	var err error
	var size int64
	var pos int64
	// First get current position so we can restore that later
	if pos, err = d.Position(); err != nil {
		return 0, err
	}
	if size, err = d.f.Seek(0, io.SeekEnd); err != nil {
		return 0, err
	}
	if _, err = d.f.Seek(0, io.SeekStart); err != nil {
		return size, err
	}

// Restore position, if not at beginning
	if pos != 0 {
		if _, err = d.f.Seek(pos, io.SeekStart); err != nil {
			return size, err
		}
	}

return size, nil
}

// Check for magic bytes at the beginning of the disk
func (d *Disk) CheckMagic() error {
	if d.f == nil {
		return fmt.Errorf("disk not opened")
	}
	if off, err := d.seekWhence(io.SeekStart); err != nil {
		return err
	} else if off != 0 {
		return fmt.Errorf("seek start failed (pos %d)", off)
	}

// Read magic bytes at beginning
	buf := make([]byte, CHUNKSIZE)
	if n, err := d.f.Read(buf); err != nil {
		return err
	} else if n != CHUNKSIZE {
		return fmt.Errorf("cannot read full chunk")
	}

if !isDiskMagic(buf) {
		return fmt.Errorf("invalid disk magic")
	}

return nil
}

/* Prepare the disk for usage
 * This is already a destructive function as it writes the magic bytes to the beginning of the disk!
 */
func (d *Disk) Prepare() error {
	if d.f == nil {
		return fmt.Errorf("disk not opened")
	}

if _, err := d.f.Write(DISKMAGIC); err != nil {
		return err
	}
	return d.f.Sync()
}

/* Writes the given chunk
 * Warning: This function does not check if the disk is opened!
 */
func (d *Disk) Write(buf []byte) (int, error) {
	return d.f.Write(buf)
}

/* Reads at the current position
 * Warning: This function does not check if the disk is opened!
 */
func (d *Disk) Read(buf []byte) (int, error) {
	return d.f.Read(buf)
}

/* Performs a sync
 * Warning: This function does not check if the disk is opened!
 */
func (d *Disk) Sync() error {
	return d.f.Sync()
}
0707010000000A000081A4000001D9000001DA00000001605C47BC00003AD4000000000000000000000000000000000000002900000000disko-san-1.2/cmd/disko-san/disko-san.gopackage main

import (
	"fmt"
	"os"
	"os/signal"
	"syscall"
	"time"
)

// Program configuration parameters
type conf struct {
	disk     string
	progress string // Progress file for continue the job later on
	stats    string // Performance log
	verbose  bool
}

var cf conf
var avg float32    // average for average smoothing
var running bool   // running flag
var done chan bool // Signal for when the main thread is completed

func (cf *conf) CheckValid() error {

if cf.disk == "" {
		return fmt.Errorf("missing disk file")
	}
	return nil
}

func fileExists(filename string) bool {
	if _, err := os.Stat(filename); os.IsNotExist(err) {
		return false
	}
	return true
}

func smooth(val float32, alpha float32) float32 {
	if avg == 0 {
		avg = val
	} else {
		avg = alpha*avg + (1.0-alpha)*val
	}
	return avg
}

func gibistr(bytes float32) string {
	if bytes >= 1024 {
		kb := bytes / 1024.0
		if kb > 1024 {
			mb := kb / 1024.0
			if mb > 1024 {
				gb := mb / 1024.0
				if gb > 1024 {
					tb := gb / 1024
					if tb > 1024 {
						pb := tb / 1024
						return fmt.Sprintf("%.2f PiB", pb)
					}
					return fmt.Sprintf("%.2f TiB", tb)
				}
				return fmt.Sprintf("%.2f GiB", gb)
			}
			return fmt.Sprintf("%.2f MiB", mb)
		}
		return fmt.Sprintf("%.2f kiB", kb)
	}
	return fmt.Sprintf("%.2f B", bytes)
}

func bufCompare(a []byte, b []byte) bool {
	n := len(a)
	if len(b) != n {
		return false
	}
	for i := 0; i < n; i++ {
		if a[i] != b[i] {
			return false
		}
	}
	return true
}

/* Check the internal functions.
 * We write the first chunk and check if it verifies, then we corrupt it and check if the verification fails
 */
func CheckInternals(disk *Disk) error {
	var n int
	var err error
	chunk := make([]byte, CHUNKSIZE)

pos, err := disk.Position()
	if err != nil {
		return err
	}
	defer disk.Seek(pos) // Return original disk position at the end

if err = disk.Seek(CHUNKSIZE); err != nil {
		return err
	}
	CreateChunk(chunk)
	if !VerifyChunk(chunk) {
		return fmt.Errorf("chunk verification function failed")
	}
	if n, err = disk.Write(chunk); err != nil {
		return err
	} else if n < CHUNKSIZE { // Suspicious: First trunk is already truncated?
		fmt.Fprintf(os.Stderr, "Warning: First chunk already truncated\n")
		chunk = chunk[:n]
	}
	if err := disk.Sync(); err != nil {
		return err
	}

// Now read the chunk, it must be the same
	buf := make([]byte, n)
	if err := disk.Seek(CHUNKSIZE); err != nil { // Move back to where we wrote before
		return err
	}
	if n, err := disk.Read(buf); err != nil {
		return err
	} else if n != len(buf) {
		fmt.Fprintf(os.Stderr, "Read chunk size (%d) is not the same size as write chunk size (%d)\n", n, len(buf))
		return fmt.Errorf("chunk size mismatch")
	}
	// Primitive check, if the read buffer compares to the written buffer
	if !bufCompare(buf, chunk) {
		return fmt.Errorf("read chunk is not the same as the written chunk")
	}
	// In principle a redundant check, but it does not hurt here
	if !VerifyChunk(buf) {
		return fmt.Errorf("read chunk verification check failed")
	}

// Now we do something nasty. Corrupt the chunk, write it again and then the verification must fail
	chunk[5]++ // corrupt chunk
	if VerifyChunk(chunk) {
		return fmt.Errorf("chunk verification passed after corruption")
	}
	if err := disk.Seek(CHUNKSIZE); err != nil { // Move back to first chunk
		return err
	}
	if n, err = disk.Write(chunk); err != nil {
		return err
	} else if n != len(chunk) { // This should never happen here again!!
		return fmt.Errorf("write buffer decreased")
	}
	if err := disk.Seek(CHUNKSIZE); err != nil { // Move back to first chunk
		return err
	}
	if n, err := disk.Read(buf); err != nil {
		return err
	} else if n != len(buf) {
		fmt.Fprintf(os.Stderr, "Read chunk size (%d) is not the same size as write chunk size (%d)\n", n, len(buf))
		return fmt.Errorf("chunk size mismatch")
	}
	// Primitive check, if the read buffer compares to the written buffer
	if !bufCompare(buf, chunk) {
		return fmt.Errorf("read chunk is not the same as the written chunk")
	}
	// In principle again redundant check, but it does not hurt here
	if VerifyChunk(buf) {
		return fmt.Errorf("corrupted chunk reports valid verification")
	}

// Important: Restore a valid chunk otherwise resume will fail because disk contains now a invalid chunk at position 1
	CreateChunk(chunk)
	if !VerifyChunk(chunk) {
		return fmt.Errorf("chunk verification function failed")
	}
	if err := disk.Seek(CHUNKSIZE); err != nil { // Move back to first chunk
		return err
	}
	if n, err = disk.Write(chunk); err != nil {
		return err
	} else if n < CHUNKSIZE { // Suspicious: First trunk is already truncated?
		fmt.Fprintf(os.Stderr, "Warning: First chunk already truncated\n")
		chunk = chunk[:n]
	}
	if err := disk.Sync(); err != nil {
		return err
	}

return nil
}

/* Do the write check*/
func WriteCheck(disk *Disk, progress *Progress, statsFile string) error {
	var stats *os.File // stats file, if present
	chunk := make([]byte, CHUNKSIZE)

if statsFile != "" {
		var err error
		exists := fileExists(statsFile)
		stats, err = os.OpenFile(statsFile, os.O_WRONLY|os.O_APPEND|os.O_CREATE, 0640)
		if err != nil {
			return fmt.Errorf("Error opening stats file : %s", err)
		}
		// Write stats file header only once
		if !exists {
			if _, err := stats.Write([]byte("# disko-san performance metrics file\nPosition [B], Size [B], Millis [ms]\n\n")); err != nil {
				return fmt.Errorf("Error writing header to stats file : %s", err)
			}
		}
		defer stats.Close()
	}

// Move to position
	if progress.Pos == 0 {
		progress.Pos = CHUNKSIZE // First chunk contains magic, skip it
	}
	if err := disk.Seek(progress.Pos); err != nil {
		return err
	}

// Background chunk production instance
	var cf ChunkFactory
	cf.StartProduce(CHUNKSIZE)
	defer cf.Stop()

fmt.Printf("\033[s") // save cursor position
	for progress.Pos < progress.Size {
		if !running {
			return fmt.Errorf("interrupted")
		}
		// Determine size of current chunk - at the end of the disk this might not be the full size anymore
		size := int64(CHUNKSIZE)
		if progress.Pos+CHUNKSIZE > progress.Size {
			size = progress.Size - progress.Pos
			chunk = chunk[:size]
		}

// Create chunk
		if err := cf.Read(chunk); err != nil {
			return fmt.Errorf("ChunkFactory read error: %s", err)
		}
		// Write chunk to file with runtime
		runtime := time.Now().UnixNano()
		if n, err := disk.Write(chunk); err != nil {
			return err
		} else {
			size = int64(n)
		}
		if err := disk.Sync(); err != nil {
			return err
		}
		runtime = time.Now().UnixNano() - runtime
		millis := runtime / 1e6

// Write performance stats
		if statsFile != "" {
			line := fmt.Sprintf("%d,%d,%d\n", progress.Pos, size, millis)
			if _, err := stats.Write([]byte(line)); err != nil {
				return fmt.Errorf("Error writing to stats file: %s", err)
			}
		}

// Update progress
		progress.Pos += size
		if err := progress.WriteIfOpen(); err != nil {
			return fmt.Errorf("Error writing progress file: %s", err)
		}

// Compute throughput and print update
		throughput := (float32(size) / float32(millis)) * 1e3

fmt.Printf("\033[u") // restore cursor position
		fmt.Printf("\033[K") // erase rest of line
		percent := 100.0 * (float32(progress.Pos) / float32(disk.Size()))
		fmt.Printf("Writing chunks: %.2f %% done @ %s/s", percent, gibistr(smooth(throughput, 0.75)))
	}

fmt.Printf("\033[u") // restore cursor position
	fmt.Printf("\033[K") // erase rest of line
	fmt.Println("Write test successful")

return nil
}

/* Do the read check*/
func ReadCheck(disk *Disk, progress *Progress) error {
	chunk := make([]byte, CHUNKSIZE)

// Move to position
	if progress.Pos == 0 {
		progress.Pos = CHUNKSIZE // First chunk contains magic, skip it
	}
	if err := disk.Seek(progress.Pos); err != nil {
		return err
	}

// Read chunks one by one and verify them
	fmt.Printf("\033[s") // save cursor position
	for progress.Pos < progress.Size {
		if !running {
			return fmt.Errorf("interrupted")
		}
		// Read and verify chunk
		runtime := time.Now().UnixNano()
		n, err := disk.Read(chunk)
		runtime = time.Now().UnixNano() - runtime
		if err != nil {
			return err
		} else if n < len(chunk) { // at the end of the disk, the chunk might be smaller
			chunk = chunk[:n]
		}
		if !VerifyChunk(chunk) {
			fmt.Println()
			fmt.Fprintf(os.Stderr, "Chunk %d verification error (disk position %d)\n", progress.Pos/CHUNKSIZE, progress.Pos)
			return err
		}

// Update progress
		progress.Pos += int64(n)
		if err := progress.WriteIfOpen(); err != nil {
			return fmt.Errorf("Error writing progress file: %s", err)
		}

// Print stats
		millis := runtime / 1e6
		throughput := (float32(n) / float32(millis)) * 1e3
		fmt.Printf("\033[u") // restore cursor position
		fmt.Printf("\033[K") // erase rest of line
		percent := 100.0 * (float32(progress.Pos) / float32(disk.Size()))
		fmt.Printf("Reading chunks: %.2f %% done @ %s/s", percent, gibistr(smooth(throughput, 0.75)))
	}

fmt.Printf("\033[u") // restore cursor position
	fmt.Printf("\033[K") // erase rest of line
	fmt.Println("Read test successful")

return nil
}

func printUsage() {
	fmt.Printf("Usage: %s DISK [PROGRESS] [SPEEDLOG]\n", os.Args[0])
	fmt.Println("    DISK:         Disk file under test")
	fmt.Println("    PROGRESS:     Progress file, required for job continuation")
	fmt.Println("    SPEEDLOG:     Performance metrics log")
}

func parseArgs(args []string, cf *conf) error {
	if len(args) < 2 {
		printUsage()
		os.Stdout.Sync() // Ensure usage is flushed to stdout before returning with an error
		return fmt.Errorf("Missing arguments")
	}
	if len(args) >= 2 {
		cf.disk = args[1]
		if cf.disk == "-h" || cf.disk == "--help" {
			printUsage()
			os.Exit(0)
		}
	}
	if len(args) >= 3 {
		cf.progress = args[2]
	}
	if len(args) >= 4 {
		cf.stats = args[3]
	}
	if len(args) > 4 {
		return fmt.Errorf("too many arguments")
	}
	return nil
}

func terminationSignalHandler() {
	sigs := make(chan os.Signal, 1)
	signal.Notify(sigs, syscall.SIGINT, syscall.SIGTERM)
	sig := <-sigs
	fmt.Println(sig)
	running = false
	// Wait for termination signal but quit after 2 seconds unconditionally
	select {
	case <-done:
		os.Exit(1)
	case <-time.After(2 * time.Second):
		fmt.Fprintf(os.Stderr, "Termination timeout. Forcefully quiting.\n")
		os.Exit(1)
	}
	// Just to be sure
	os.Exit(1)
}

func main() {
	var progress Progress
	done = make(chan bool, 1)
	running = true

// Default settings
	cf.disk = ""
	cf.progress = ""
	cf.stats = ""
	cf.verbose = false

if err := parseArgs(os.Args, &cf); err != nil {
		fmt.Fprintf(os.Stderr, "%s\n", err)
		os.Exit(1)
	}

// Check configuration for validity
	if err := cf.CheckValid(); err != nil {
		fmt.Fprintf(os.Stderr, "%s\n", err)
		os.Exit(1)
	}

// Prepare disk
	disk := CreateDisk(cf.disk)
	if err := disk.Open(); err != nil {
		fmt.Fprintf(os.Stderr, "Error opening disk: %s\n", err)
		os.Exit(1)
	}
	defer disk.Close()

// Load progress stats if present
	if cf.progress != "" {
		if fileExists(cf.progress) {
			if err := progress.Open(cf.progress); err != nil {
				fmt.Fprintf(os.Stderr, "Error opening progress file %s: %s\n", cf.progress, err)
				os.Exit(1)
			}
			if err := progress.Read(); err != nil {
				fmt.Fprintf(os.Stderr, "Error reading progress file %s: %s\n", cf.progress, err)
				os.Exit(1)
			}
			if progress.State == 0 {
				fmt.Printf("Resume operation on disk\n")
			} else if progress.State == 1 {
				percent := 100.0 * (float32(progress.Pos) / float32(disk.Size()))
				fmt.Printf("Resuming write test at %d (%.2f %% already done)\n", progress.Pos, percent)
			} else if progress.State == 2 {
				percent := 100.0 * (float32(progress.Pos) / float32(disk.Size()))
				fmt.Printf("Resuming read test at %d (%.2f %% already done)\n", progress.Pos, percent)
			} else if progress.State == 3 {
				fmt.Println("Disk already completed. Nothing to be done")
				os.Exit(0)
			} else {
				fmt.Fprintf(os.Stderr, "Invalid progress state %d\n", progress.State)
				os.Exit(1)
			}
		} else {
			// Create file
			if err := progress.Open(cf.progress); err != nil {
				fmt.Fprintf(os.Stderr, "Error creating progress file %s: %s\n", cf.progress, err)
				os.Exit(1)
			}
			// Defaults
			progress.Pos = 0
			progress.State = 0
			progress.Size = disk.Size()
			if err := progress.Write(); err != nil {
				fmt.Fprintf(os.Stderr, "Error writing to new progress file %s: %s\n", cf.progress, err)
				os.Exit(1)
			}
		}
	} else {
		// Set progress values to defaults
		progress.Size = disk.Size()
		progress.Pos = 0
		progress.State = 0
	}

if disk.Size() <= 0 {
		fmt.Fprintf(os.Stderr, "Invalid disk size %d\n", disk.Size())
		os.Exit(1)
	}

// Check program internals before each run.
	if err := CheckInternals(&disk); err != nil {
		fmt.Fprintf(os.Stderr, "FATAL ERROR: Pre-flight checks failed. This is a program error, please report a bug!\n")
		fmt.Fprintf(os.Stderr, "%s\n", err)
		os.Exit(42)
	}
	// Perform disk pre-flight checks, if we continue from a disk
	if cf.progress != "" {
		if progress.State < 0 || progress.State > 3 {
			fmt.Fprintf(os.Stderr, "Invalid progress state %d\n", progress.State)
			os.Exit(1)
		}

if disk.Size() != progress.Size {
			fmt.Fprintf(os.Stderr, "Error: disk size mismatch\n")
			fmt.Fprintf(os.Stderr, "The disk reports %d bytes, but the progress file says it should be %d (wrong disk?)\n", disk.Size(), progress.Size)
			os.Exit(1)
		}
		// Disk magic check only after preparation step
		if progress.State > 0 {
			if err := disk.CheckMagic(); err != nil {
				fmt.Fprintf(os.Stderr, "Disk magic error: %s\n", err)
				os.Exit(1)
			}
		}
	} else {
		progress.Size = disk.Size()
	}

// Termination signal handler
	go terminationSignalHandler()

// Preparation step
	if progress.State == 0 {
		// Prepare disk
		if err := disk.Prepare(); err != nil {
			fmt.Fprintf(os.Stderr, "Disk preparation error: %s\n", err)
			os.Exit(10)
		}
		progress.State = 1
		progress.Pos = 0
		if err := progress.WriteIfOpen(); err != nil {
			fmt.Fprintf(os.Stderr, "Error writing progress file: %s\n", err)
			os.Exit(1)
		}
	}

// Write step
	if progress.State == 1 {
		if err := WriteCheck(&disk, &progress, cf.stats); err != nil {
			if err.Error() == "interrupted" {
				done <- true
				fmt.Fprintf(os.Stderr, "Cancelled\n")
			} else {
				fmt.Fprintf(os.Stderr, "Write check failed: %s\n", err)
			}
			os.Exit(11)
		}
		progress.State = 2
		progress.Pos = 0
		if err := progress.WriteIfOpen(); err != nil {
			fmt.Fprintf(os.Stderr, "Error writing progress file: %s\n", err)
			os.Exit(1)
		}
	}

// Read step
	if progress.State == 2 {
		if err := ReadCheck(&disk, &progress); err != nil {
			if err.Error() == "interrupted" {
				done <- true
				fmt.Fprintf(os.Stderr, "Cancelled\n")
			} else {
				fmt.Fprintf(os.Stderr, "Read check failed: %s\n", err)
			}
			os.Exit(12)
		}
		progress.State = 3
		if err := progress.WriteIfOpen(); err != nil {
			fmt.Fprintf(os.Stderr, "Error writing progress file: %s\n", err)
			os.Exit(1)
		}
	}

// All good
	done <- true
	fmt.Println("Done")
}
0707010000000B000081A4000001D9000001DA00000001605C47BC000008C0000000000000000000000000000000000000002800000000disko-san-1.2/cmd/disko-san/progress.gopackage main

import (
	"bufio"
	"fmt"
	"io"
	"os"
	"strconv"
)

// Progress struct for continuing
type Progress struct {
	filename string // Filename of the progress file
	Size     int64  // Disk size
	Pos      int64  // Disk position
	State    int    // State of the process (0 = prepare, 1 = write, 2 = read, 3 = completed)

f *os.File // Progress file handle or nil, if not present
}

func (p *Progress) Open(filename string) error {
	var err error
	p.f, err = os.OpenFile(filename, os.O_RDWR|os.O_CREATE, 0640)
	if err != nil {
		p.f = nil
		return err
	}
	p.filename = filename
	return nil
}

func (p *Progress) Close() error {
	if p.f != nil {
		err := p.f.Close()
		p.f = nil
		return err
	}
	return nil
}

func (p *Progress) Read() error {
	var err error
	if p.f == nil {
		return fmt.Errorf("no file opened")
	}

// Seek to beginning of file. This is required as we leave the file opened
	if _, err := p.f.Seek(0, io.SeekStart); err != nil {
		return err
	}

// Line by line
	scanner := bufio.NewScanner(p.f)
	if !scanner.Scan() {
		return fmt.Errorf("Premature file ending")
	}
	if p.Size, err = strconv.ParseInt(scanner.Text(), 10, 64); err != nil {
		return err
	}
	if !scanner.Scan() {
		return fmt.Errorf("Premature file ending")
	}
	if p.Pos, err = strconv.ParseInt(scanner.Text(), 10, 64); err != nil {
		return err
	}
	if !scanner.Scan() {
		return fmt.Errorf("Premature file ending")
	}
	if p.State, err = strconv.Atoi(scanner.Text()); err != nil {
		return err
	}
	return nil
}

func (p *Progress) Write() error {
	if p.f == nil {
		return fmt.Errorf("no file opened")
	}

// Seek to beginning of file. This is required as we leave the file opened
	if _, err := p.f.Seek(0, io.SeekStart); err != nil {
		return err
	}

str := fmt.Sprintf("%d\n%d\n%d", p.Size, p.Pos, p.State)
	if n, err := p.f.Write([]byte(str)); err != nil {
		return err
	} else {
		// Truncate file to the written buffer only
		if _, err := p.f.Seek(0, io.SeekStart); err != nil {
			return err
		}
		return p.f.Truncate(int64(n))
	}
}

func (p *Progress) WriteIfOpen() error {
	if p.f == nil {
		return nil
	}
	return p.Write()
}

func (p *Progress) Sync() error {
	if p.f == nil {
		return fmt.Errorf("no file opened")
	}
	return p.f.Sync()
}
0707010000000C000081A4000001D9000001DA00000001605C47BC0000002D000000000000000000000000000000000000001500000000disko-san-1.2/go.modmodule github.com/grisu48/disko-san

go 1.14
07070100000000000000000000000000000000000000010000000000000000000000000000000000000000000000000000000B00000000TRAILER!!!121 blocks

Places

File _service:obs_scm:disko-san-1.2.obscpio of Package disko-san

Places