Compare commits
No commits in common. "guimaster" and "v0.0.2" have entirely different histories.
|
|
@ -1,10 +1,3 @@
|
|||
*.swp
|
||||
go.sum
|
||||
go.mod
|
||||
|
||||
control-panel-dns
|
||||
/files/*
|
||||
/*.deb
|
||||
/plugins/*
|
||||
|
||||
control-panel-dns
|
||||
|
|
|
|||
674
LICENSE
674
LICENSE
|
|
@ -1,674 +0,0 @@
|
|||
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>.
|
||||
17
Makefile
17
Makefile
|
|
@ -1,17 +0,0 @@
|
|||
all: goimports vet
|
||||
|
||||
vet:
|
||||
GO111MODULE=off go vet
|
||||
|
||||
goimports:
|
||||
goimports -w *.go
|
||||
|
||||
redomod:
|
||||
rm -f go.*
|
||||
goimports -w *.go
|
||||
GO111MODULE= go mod init
|
||||
GO111MODULE= go mod tidy
|
||||
|
||||
clean:
|
||||
-rm -f go.*
|
||||
-go-mod-clean --purge
|
||||
450
RFC-8482
450
RFC-8482
|
|
@ -1,450 +0,0 @@
|
|||
Internet Engineering Task Force (IETF) J. Abley
|
||||
Request for Comments: 8482 Afilias
|
||||
Updates: 1034, 1035 O. Gudmundsson
|
||||
Category: Standards Track M. Majkowski
|
||||
ISSN: 2070-1721 Cloudflare Inc.
|
||||
E. Hunt
|
||||
ISC
|
||||
January 2019
|
||||
|
||||
|
||||
Providing Minimal-Sized Responses to DNS Queries That Have QTYPE=ANY
|
||||
|
||||
Abstract
|
||||
|
||||
The Domain Name System (DNS) specifies a query type (QTYPE) "ANY".
|
||||
The operator of an authoritative DNS server might choose not to
|
||||
respond to such queries for reasons of local policy, motivated by
|
||||
security, performance, or other reasons.
|
||||
|
||||
The DNS specification does not include specific guidance for the
|
||||
behavior of DNS servers or clients in this situation. This document
|
||||
aims to provide such guidance.
|
||||
|
||||
This document updates RFCs 1034 and 1035.
|
||||
|
||||
Status of This Memo
|
||||
|
||||
This is an Internet Standards Track document.
|
||||
|
||||
This document is a product of the Internet Engineering Task Force
|
||||
(IETF). It represents the consensus of the IETF community. It has
|
||||
received public review and has been approved for publication by the
|
||||
Internet Engineering Steering Group (IESG). Further information on
|
||||
Internet Standards is available in Section 2 of RFC 7841.
|
||||
|
||||
Information about the current status of this document, any errata,
|
||||
and how to provide feedback on it may be obtained at
|
||||
https://www.rfc-editor.org/info/rfc8482.
|
||||
|
||||
|
||||
Copyright Notice
|
||||
|
||||
Copyright (c) 2019 IETF Trust and the persons identified as the
|
||||
document authors. All rights reserved.
|
||||
|
||||
This document is subject to BCP 78 and the IETF Trust's Legal
|
||||
Provisions Relating to IETF Documents
|
||||
(https://trustee.ietf.org/license-info) in effect on the date of
|
||||
publication of this document. Please review these documents
|
||||
carefully, as they describe your rights and restrictions with respect
|
||||
to this document. Code Components extracted from this document must
|
||||
include Simplified BSD License text as described in Section 4.e of
|
||||
the Trust Legal Provisions and are provided without warranty as
|
||||
described in the Simplified BSD License.
|
||||
|
||||
Table of Contents
|
||||
|
||||
1. Introduction ....................................................3
|
||||
1.1. Terminology ................................................3
|
||||
2. Motivations for Use of ANY Queries ..............................3
|
||||
3. General Approach ................................................4
|
||||
4. Behavior of DNS Responders ......................................5
|
||||
4.1. Answer with a Subset of Available RRsets ...................5
|
||||
4.2. Answer with a Synthesized HINFO RRset ......................5
|
||||
4.3. Answer with Best Guess as to Intention .....................6
|
||||
4.4. Transport Considerations ...................................6
|
||||
5. Behavior of DNS Initiators ......................................7
|
||||
6. HINFO Considerations ............................................7
|
||||
7. Updates to RFCs 1034 and 1035 ...................................7
|
||||
8. Implementation Experience .......................................8
|
||||
9. Security Considerations .........................................8
|
||||
10. IANA Considerations ............................................9
|
||||
11. References .....................................................9
|
||||
11.1. Normative References ......................................9
|
||||
11.2. Informative References ....................................9
|
||||
Acknowledgements ..................................................10
|
||||
Authors' Addresses ................................................10
|
||||
|
||||
|
||||
1. Introduction
|
||||
|
||||
The Domain Name System (DNS) specifies a query type (QTYPE) "ANY".
|
||||
The operator of an authoritative DNS server might choose not to
|
||||
respond to such queries for reasons of local policy, motivated by
|
||||
security, performance, or other reasons.
|
||||
|
||||
The DNS specification [RFC1034] [RFC1035] does not include specific
|
||||
guidance for the behavior of DNS servers or clients in this
|
||||
situation. This document aims to provide such guidance.
|
||||
|
||||
1.1. Terminology
|
||||
|
||||
This document uses terminology specific to the Domain Name System
|
||||
(DNS), descriptions of which can be found in [RFC8499].
|
||||
|
||||
[RFC1035] defined type 255 to be "*". However, DNS implementations
|
||||
commonly use the keyword "ANY" to refer to that type code; this
|
||||
document follows that common usage.
|
||||
|
||||
In this document, "ANY query" refers to a DNS meta-query with
|
||||
QTYPE=ANY. An "ANY response" is a response to such a query.
|
||||
|
||||
In this document, "conventional ANY response" means an ANY response
|
||||
that is constructed in accordance with the algorithm documented in
|
||||
Section 4.3.2 of [RFC1034] and specifically without implementing any
|
||||
of the mechanisms described in this document.
|
||||
|
||||
In an exchange of DNS messages between two hosts, this document
|
||||
refers to the host sending a DNS request as the "initiator" and the
|
||||
host sending a DNS response as the "responder".
|
||||
|
||||
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
|
||||
"SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
|
||||
"OPTIONAL" in this document are to be interpreted as described in
|
||||
BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all
|
||||
capitals, as shown here.
|
||||
|
||||
2. Motivations for Use of ANY Queries
|
||||
|
||||
ANY queries are legitimately used for debugging and checking the
|
||||
state of a DNS server for a particular name.
|
||||
|
||||
ANY queries are sometimes used as an attempt to reduce the number of
|
||||
queries needed to get information, e.g., to obtain MX, A, and AAAA
|
||||
resource record sets (RRsets) for a mail domain in a single query.
|
||||
However, there is no documented guidance available for this use case,
|
||||
and some implementations have been observed not to function as their
|
||||
|
||||
developers expected. If implementers assume that an ANY query will
|
||||
ultimately be received by an authoritative server and will fetch all
|
||||
existing RRsets, they should include a fallback mechanism to use when
|
||||
that does not happen.
|
||||
|
||||
ANY queries are frequently used to exploit the amplification
|
||||
potential of DNS servers and resolvers using spoofed source addresses
|
||||
and UDP transport (see [RFC5358]). Having the ability to return
|
||||
small responses to such queries makes DNS servers less attractive
|
||||
amplifiers.
|
||||
|
||||
ANY queries are sometimes used to help mine authoritative-only DNS
|
||||
servers for zone data, since they are expected to return all RRsets
|
||||
for a particular query name. If DNS operators prefer to reduce the
|
||||
potential for information leaks, they might choose not to send large
|
||||
ANY responses.
|
||||
|
||||
Some authoritative-only DNS server implementations require additional
|
||||
processing in order to send a conventional ANY response; avoiding
|
||||
that processing expense might be desirable.
|
||||
|
||||
3. General Approach
|
||||
|
||||
This proposal provides a mechanism for an authoritative DNS server to
|
||||
signal that conventional ANY queries are not supported for a
|
||||
particular QNAME. It does so in a way that is both compatible with
|
||||
and triggers desirable behavior by unmodified clients (e.g., DNS
|
||||
resolvers).
|
||||
|
||||
Alternative proposals for dealing with ANY queries have been
|
||||
discussed. One approach proposes using a new RCODE to signal that an
|
||||
authoritative server did not answer ANY queries in the standard way.
|
||||
This approach was found to have an undesirable effect on both
|
||||
resolvers and authoritative-only servers; resolvers receiving an
|
||||
unknown RCODE would resend the same query to all available
|
||||
authoritative servers rather than suppress future ANY queries for the
|
||||
same QNAME.
|
||||
|
||||
The proposal described in this document avoids that outcome by
|
||||
returning a non-empty RRset in the ANY response, which provides
|
||||
resolvers with something to cache and effectively suppresses repeat
|
||||
queries to the same or different authoritative DNS servers.
|
||||
|
||||
|
||||
4. Behavior of DNS Responders
|
||||
|
||||
Below are the three different modes of behavior by DNS responders
|
||||
when processing queries with QNAMEs that exist, QCLASS=IN, and
|
||||
QTYPE=ANY. Operators and implementers are free to choose whichever
|
||||
mechanism best suits their environment.
|
||||
|
||||
1. A DNS responder can choose to select one or a larger subset of
|
||||
the available RRsets at the QNAME.
|
||||
|
||||
2. A DNS responder can return a synthesized HINFO resource record.
|
||||
See Section 6 for discussion of the use of HINFO.
|
||||
|
||||
3. A resolver can try to give out the most likely records the
|
||||
requester wants. This is not always possible, and the result
|
||||
might well be a large response.
|
||||
|
||||
Except as described below in this section, the DNS responder MUST
|
||||
follow the standard algorithms when constructing a response.
|
||||
|
||||
4.1. Answer with a Subset of Available RRsets
|
||||
|
||||
A DNS responder that receives an ANY query MAY decline to provide a
|
||||
conventional ANY response or MAY instead send a response with a
|
||||
single RRset (or a larger subset of available RRsets) in the answer
|
||||
section.
|
||||
|
||||
The RRsets returned in the answer section of the response MAY consist
|
||||
of a single RRset owned by the name specified in the QNAME. Where
|
||||
multiple RRsets exist, the responder SHOULD choose a small subset of
|
||||
those available to reduce the amplification potential of the
|
||||
response.
|
||||
|
||||
If the zone is signed, appropriate RRSIG records MUST be included in
|
||||
the answer.
|
||||
|
||||
Note that this mechanism does not provide any signaling to indicate
|
||||
to a client that an incomplete subset of the available RRsets has
|
||||
been returned.
|
||||
|
||||
4.2. Answer with a Synthesized HINFO RRset
|
||||
|
||||
If there is no CNAME present at the owner name matching the QNAME,
|
||||
the resource record returned in the response MAY instead be
|
||||
synthesized. In this case, a single HINFO resource record SHOULD be
|
||||
returned. The CPU field of the HINFO RDATA SHOULD be set to
|
||||
"RFC8482". The OS field of the HINFO RDATA SHOULD be set to the null
|
||||
string to minimize the size of the response.
|
||||
|
||||
The TTL encoded for the synthesized HINFO resource record SHOULD be
|
||||
chosen by the operator of the DNS responder to be large enough to
|
||||
suppress frequent subsequent ANY queries from the same initiator with
|
||||
the same QNAME, understanding that a TTL that is too long might make
|
||||
policy changes relating to ANY queries difficult to change in the
|
||||
future. The specific value used SHOULD be configurable by the
|
||||
operator of the nameserver according to local policy, based on the
|
||||
familiar considerations involved in choosing a TTL value for any
|
||||
resource record in any zone.
|
||||
|
||||
If the DNS query includes DO=1 and the QNAME corresponds to a zone
|
||||
that is known by the responder to be signed, a valid RRSIG for the
|
||||
RRsets in the answer (or authority if answer is empty) section MUST
|
||||
be returned. In the case of DO=0, the RRSIG SHOULD be omitted.
|
||||
|
||||
A system that receives an HINFO response SHOULD NOT infer that the
|
||||
response was generated according to this specification and apply any
|
||||
special processing of the response because, in general, it is not
|
||||
possible to tell with certainty whether the HINFO RRset received was
|
||||
synthesized. In particular, systems SHOULD NOT rely upon the HINFO
|
||||
RDATA described in this section to distinguish between synthesized
|
||||
and non-synthesized HINFO RRsets.
|
||||
|
||||
4.3. Answer with Best Guess as to Intention
|
||||
|
||||
In some cases, it is possible to guess what the initiator wants in
|
||||
the answer (but not always). Some implementations have implemented
|
||||
the spirit of this document by returning all RRsets of RRTYPE CNAME,
|
||||
MX, A, and AAAA that are present at the owner name while suppressing
|
||||
others. This heuristic seems to work well in practice; it satisfies
|
||||
the needs of some applications whilst suppressing other RRsets such
|
||||
as TXT and DNSKEY that can often contribute to large responses.
|
||||
Whilst some applications may be satisfied by this behavior, the
|
||||
resulting responses in the general case are larger than in the
|
||||
approaches described in Sections 4.1 and 4.2.
|
||||
|
||||
As before, if the zone is signed and the DO bit is set on the
|
||||
corresponding query, an RRSIG RRset MUST be included in the response.
|
||||
|
||||
4.4. Transport Considerations
|
||||
|
||||
A DNS responder MAY behave differently when processing ANY queries
|
||||
received over different transports, e.g., by providing a conventional
|
||||
ANY response over TCP whilst using one of the other mechanisms
|
||||
specified in this document in the case where a query was received
|
||||
using UDP.
|
||||
|
||||
Implementers MAY provide configuration options to allow operators to
|
||||
specify different behavior over different transports.
|
||||
|
||||
5. Behavior of DNS Initiators
|
||||
|
||||
A DNS initiator that sends a query with QTYPE=ANY and receives a
|
||||
response containing an HINFO resource record or a single RRset, as
|
||||
described in Section 4, MAY cache the response in the normal way.
|
||||
Such cached resource records SHOULD be retained in the cache
|
||||
following normal caching semantics, as with any other response
|
||||
received from a DNS responder.
|
||||
|
||||
A DNS initiator MAY suppress queries with QTYPE=ANY in the event that
|
||||
the local cache contains a matching HINFO resource record with the
|
||||
CPU field of the HINFO RDATA, as described in Section 4. A DNS
|
||||
initiator MAY instead respond to such queries with the contents of
|
||||
the local cache in the usual way.
|
||||
|
||||
6. HINFO Considerations
|
||||
|
||||
It is possible that the synthesized HINFO RRset in an ANY response,
|
||||
once cached by the initiator, might suppress subsequent queries from
|
||||
the same initiator with QTYPE=HINFO. Thus, the use of HINFO in this
|
||||
proposal would effectively mask the HINFO RRset present in the zone.
|
||||
|
||||
Operators of authoritative servers who serve zones that rely upon
|
||||
conventional use of the HINFO RRTYPE SHOULD sensibly choose the
|
||||
"single RRset" method described in this document or select another
|
||||
type.
|
||||
|
||||
The HINFO RRTYPE is believed to be rarely used in the DNS at the time
|
||||
of writing, based on observations made in passive DNS and at
|
||||
recursive and authoritative DNS servers.
|
||||
|
||||
7. Updates to RFCs 1034 and 1035
|
||||
|
||||
This document extends the specification for processing ANY queries
|
||||
described in Section 4.3.2 of [RFC1034].
|
||||
|
||||
It is important to note that returning a subset of available RRsets
|
||||
when processing an ANY query is legitimate and consistent with
|
||||
[RFC1035]; it can be argued that ANY does not always mean ALL, as
|
||||
used in Section 3.2.3 of [RFC1035]. The main difference here is that
|
||||
the TC bit SHOULD NOT be set in the response, thus indicating that
|
||||
this is not a complete answer.
|
||||
|
||||
This document describes optional behavior for both DNS initiators and
|
||||
responders; implementation of the guidance provided by this document
|
||||
is OPTIONAL.
|
||||
|
||||
RRSIG queries (i.e., queries with QTYPE=RRSIG) are similar to ANY
|
||||
queries in the sense that they have the potential to generate large
|
||||
responses as well as extra work for the responders that process them,
|
||||
e.g., in the case where signatures are generated on the fly. RRSIG
|
||||
RRsets are not usually obtained using such explicit queries but are
|
||||
rather included in the responses for other RRsets that the RRSIGs
|
||||
cover. This document does not specify appropriate behavior for RRSIG
|
||||
queries; however, future such advice might well benefit from
|
||||
consistency with and experience with the approaches for ANY queries
|
||||
described here.
|
||||
|
||||
8. Implementation Experience
|
||||
|
||||
In October 2015, the Cloudflare authoritative nameserver
|
||||
implementation implemented the HINFO response. A few minor problems
|
||||
were reported and have since been resolved.
|
||||
|
||||
An implementation of the subset-mode response to ANY queries was
|
||||
implemented in NSD 4.1 in 2016.
|
||||
|
||||
An implementation of a single RRset response to an ANY query was made
|
||||
for BIND9 by Tony Finch, and that functionality was subsequently made
|
||||
available in production releases starting in BIND 9.11.
|
||||
|
||||
9. Security Considerations
|
||||
|
||||
Queries with QTYPE=ANY are frequently observed as part of reflection
|
||||
attacks, since a relatively small query can be used to elicit a large
|
||||
response. This is a desirable characteristic if the goal is to
|
||||
maximize the amplification potential of a DNS server as part of a
|
||||
volumetric attack. The ability of a DNS operator to suppress such
|
||||
responses on a particular server makes that server a less useful
|
||||
amplifier.
|
||||
|
||||
The optional behavior described in this document to reduce the size
|
||||
of responses to queries with QTYPE=ANY is compatible with the use of
|
||||
DNSSEC by both initiator and responder.
|
||||
|
||||
|
||||
10. IANA Considerations
|
||||
|
||||
IANA has updated the following entry in the "Resource Record (RR)
|
||||
TYPEs" registry [RR_TYPES]:
|
||||
|
||||
+------+-------+-------------------------------+--------------------+
|
||||
| TYPE | Value | Meaning | Reference |
|
||||
+------+-------+-------------------------------+--------------------+
|
||||
| * | 255 | A request for some or all | [RFC1035][RFC6895] |
|
||||
| | | records the server has | [RFC8482] |
|
||||
| | | available | |
|
||||
+------+-------+-------------------------------+--------------------+
|
||||
|
||||
11. References
|
||||
|
||||
11.1. Normative References
|
||||
|
||||
[RFC1034] Mockapetris, P., "Domain names - concepts and facilities",
|
||||
STD 13, RFC 1034, DOI 10.17487/RFC1034, November 1987,
|
||||
<https://www.rfc-editor.org/info/rfc1034>.
|
||||
|
||||
[RFC1035] Mockapetris, P., "Domain names - implementation and
|
||||
specification", STD 13, RFC 1035, DOI 10.17487/RFC1035,
|
||||
November 1987, <https://www.rfc-editor.org/info/rfc1035>.
|
||||
|
||||
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
|
||||
Requirement Levels", BCP 14, RFC 2119,
|
||||
DOI 10.17487/RFC2119, March 1997,
|
||||
<https://www.rfc-editor.org/info/rfc2119>.
|
||||
|
||||
[RFC8174] Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC
|
||||
2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174,
|
||||
May 2017, <https://www.rfc-editor.org/info/rfc8174>.
|
||||
|
||||
11.2. Informative References
|
||||
|
||||
[RFC5358] Damas, J. and F. Neves, "Preventing Use of Recursive
|
||||
Nameservers in Reflector Attacks", BCP 140, RFC 5358,
|
||||
DOI 10.17487/RFC5358, October 2008,
|
||||
<https://www.rfc-editor.org/info/rfc5358>.
|
||||
|
||||
[RFC6895] Eastlake 3rd, D., "Domain Name System (DNS) IANA
|
||||
Considerations", BCP 42, RFC 6895, DOI 10.17487/RFC6895,
|
||||
April 2013, <https://www.rfc-editor.org/info/rfc6895>.
|
||||
|
||||
[RFC8499] Hoffman, P., Sullivan, A., and K. Fujiwara, "DNS
|
||||
Terminology", BCP 219, RFC 8499, DOI 10.17487/RFC8499,
|
||||
January 2019, <https://www.rfc-editor.org/info/rfc8499>.
|
||||
|
||||
[RR_TYPES] IANA, "Domain Name System (DNS) Parameters",
|
||||
<https://www.iana.org/assignments/dns-parameters>.
|
||||
|
||||
Acknowledgements
|
||||
|
||||
David Lawrence provided valuable observations and concrete
|
||||
suggestions. Jeremy Laidman helped make the document better. Tony
|
||||
Finch realized that this document was valuable and implemented it
|
||||
while under attack. Richard Gibson identified areas where more
|
||||
detail and accuracy were useful. A large number of other people also
|
||||
provided comments and suggestions; we thank them all for the
|
||||
feedback.
|
||||
|
||||
Authors' Addresses
|
||||
|
||||
Joe Abley
|
||||
Afilias
|
||||
300-184 York Street
|
||||
London, ON N6A 1B5
|
||||
Canada
|
||||
|
||||
Phone: +1 519 670 9327
|
||||
Email: jabley@afilias.info
|
||||
|
||||
|
||||
Olafur Gudmundsson
|
||||
Cloudflare Inc.
|
||||
|
||||
Email: olafur+ietf@cloudflare.com
|
||||
|
||||
|
||||
Marek Majkowski
|
||||
Cloudflare Inc.
|
||||
|
||||
Email: marek@cloudflare.com
|
||||
|
||||
|
||||
Evan Hunt
|
||||
ISC
|
||||
950 Charter St
|
||||
Redwood City, CA 94063
|
||||
United States of America
|
||||
|
||||
Email: each@isc.org
|
||||
38
args.go
38
args.go
|
|
@ -1,38 +0,0 @@
|
|||
package linuxstatus
|
||||
|
||||
/*
|
||||
this enables command line options from other packages like 'gui' and 'log'
|
||||
*/
|
||||
|
||||
import (
|
||||
"go.wit.com/log"
|
||||
)
|
||||
|
||||
var NOW *log.LogFlag
|
||||
var INFO *log.LogFlag
|
||||
var NET *log.LogFlag
|
||||
var DNS *log.LogFlag
|
||||
|
||||
var PROC *log.LogFlag
|
||||
var SPEW *log.LogFlag
|
||||
var WARN *log.LogFlag
|
||||
|
||||
var CHANGE *log.LogFlag
|
||||
var STATUS *log.LogFlag
|
||||
|
||||
func init() {
|
||||
full := "go.wit.com/control-panels/dns/linuxstatus"
|
||||
short := "linux"
|
||||
|
||||
NOW = log.NewFlag("NOW", true, full, short, "temp debugging stuff")
|
||||
INFO = log.NewFlag("INFO", false, full, short, "normal debugging stuff")
|
||||
NET = log.NewFlag("NET", false, full, short, "Network logging")
|
||||
DNS = log.NewFlag("DNS", false, full, short, "dnsStatus.update()")
|
||||
|
||||
PROC = log.NewFlag("PROC", false, full, short, "/proc loggging")
|
||||
WARN = log.NewFlag("WARN", true, full, short, "bad things")
|
||||
SPEW = log.NewFlag("SPEW", false, full, short, "spew stuff")
|
||||
|
||||
CHANGE = log.NewFlag("CHANGE", true, full, short, "when host or dns change")
|
||||
STATUS = log.NewFlag("STATUS", false, full, short, "Update() details")
|
||||
}
|
||||
63
common.go
63
common.go
|
|
@ -1,63 +0,0 @@
|
|||
// This creates a simple hello world window
|
||||
package linuxstatus
|
||||
|
||||
import (
|
||||
"go.wit.com/log"
|
||||
)
|
||||
|
||||
// reports externally if something has changed
|
||||
// since the last time it was asked about it
|
||||
func (ls *LinuxStatus) Changed() bool {
|
||||
if !ls.Ready() {
|
||||
return false
|
||||
}
|
||||
if ls.changed {
|
||||
ls.changed = false
|
||||
return true
|
||||
}
|
||||
return false
|
||||
}
|
||||
|
||||
func (ls *LinuxStatus) Show() {
|
||||
if !ls.Ready() {
|
||||
return
|
||||
}
|
||||
log.Log(CHANGE, "Show() window ready =", ls.ready)
|
||||
ls.window.Show()
|
||||
ls.hidden = false
|
||||
}
|
||||
|
||||
func (ls *LinuxStatus) Hide() {
|
||||
if !ls.Ready() {
|
||||
return
|
||||
}
|
||||
log.Log(CHANGE, "Hide() window ready =", ls.ready)
|
||||
ls.window.Hide()
|
||||
ls.hidden = true
|
||||
}
|
||||
|
||||
func (ls *LinuxStatus) Toggle() {
|
||||
if !ls.Ready() {
|
||||
return
|
||||
}
|
||||
log.Log(CHANGE, "Toggle() window ready =", ls.ready)
|
||||
if ls.hidden {
|
||||
ls.Show()
|
||||
} else {
|
||||
ls.Hide()
|
||||
}
|
||||
}
|
||||
|
||||
func (ls *LinuxStatus) Ready() bool {
|
||||
log.Log(SPEW, "Ready() maybe not ready? ls =", ls)
|
||||
if me == nil {
|
||||
return false
|
||||
}
|
||||
if ls == nil {
|
||||
return false
|
||||
}
|
||||
if ls.window == nil {
|
||||
return false
|
||||
}
|
||||
return me.ready
|
||||
}
|
||||
|
|
@ -0,0 +1,50 @@
|
|||
# GITVERSION=$(shell git rev-parse FETCH_HEAD)
|
||||
VERSION=$(shell git describe --tags $(git rev-list --tags --max-count=1) | sed 's/^v//')
|
||||
|
||||
BASENAME=control-panel-dns
|
||||
|
||||
all: help deb
|
||||
|
||||
help:
|
||||
@echo
|
||||
@echo "make deb # attempt to build the .deb package using dpkg"
|
||||
@echo
|
||||
|
||||
deb: clean extract DEBIAN build
|
||||
|
||||
clean:
|
||||
rm -rf ../files
|
||||
rm -f ../*.deb
|
||||
rm -f ../*.tar.xz data.tar.xz
|
||||
rm -rf DEBIAN
|
||||
|
||||
extract:
|
||||
mkdir -p ../files/usr/bin
|
||||
mkdir -p ../files/usr/lib/control-panel-dns/
|
||||
-cp ~/go/src/git.wit.org/wit/gui/toolkit/*.so ../files/usr/lib/control-panel-dns/
|
||||
cp ../README.md ../files/usr/lib/control-panel-dns/
|
||||
cp ../control-panel-dns ../files/usr/bin/
|
||||
|
||||
# makes the DEBIAN/ directory
|
||||
DEBIAN:
|
||||
mkdir -p DEBIAN
|
||||
|
||||
# make the md5sum file
|
||||
cd ../files/ && find -type f -exec md5sum '{}' \; |sort -k2 >../md5sums
|
||||
mv ../md5sums DEBIAN/
|
||||
|
||||
# make the control there
|
||||
mkdir -p DEBIAN
|
||||
cp control DEBIAN/
|
||||
echo Version: ${VERSION} >>DEBIAN/control
|
||||
|
||||
cp postinst DEBIAN
|
||||
|
||||
build:
|
||||
mv DEBIAN ../files/
|
||||
cd .. && dpkg-deb --build files ${BASENAME}_${VERSION}_amd64.deb
|
||||
@echo
|
||||
@echo '#######################'
|
||||
cd .. && dpkg-deb --info ${BASENAME}_${VERSION}_amd64.deb
|
||||
@echo '#######################'
|
||||
@echo
|
||||
|
|
@ -0,0 +1 @@
|
|||
10
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
Source: control-panel-dns
|
||||
Build-Depends: golang
|
||||
Package: control-panel-dns
|
||||
Maintainer: Jeff Carr <jcarr@wit.com>
|
||||
Architecture: amd64
|
||||
Depends:
|
||||
Recommends: libgtk-3-0, ddclient, ddupdate
|
||||
Description: a control panel for DNS and IPv6 settings
|
||||
Goals: show the settings, validate & update DNS
|
||||
|
|
@ -0,0 +1 @@
|
|||
#!/bin/sh
|
||||
36
draw.go
36
draw.go
|
|
@ -1,36 +0,0 @@
|
|||
// This creates a simple hello world window
|
||||
package linuxstatus
|
||||
|
||||
import (
|
||||
"go.wit.com/lib/gadgets"
|
||||
)
|
||||
|
||||
// creates the actual widgets.
|
||||
// it's assumed you are always passing in a box
|
||||
func draw(ls *LinuxStatus) {
|
||||
ls.group = ls.window.Box().NewGroup("What Linux Knows It Is")
|
||||
|
||||
ls.grid = ls.group.NewGrid("gridnuts", 2, 2)
|
||||
|
||||
ls.hostnameStatus = gadgets.NewOneLiner(ls.grid, "status")
|
||||
ls.hostname = gadgets.NewOneLiner(ls.grid, "hostname -f")
|
||||
ls.hostshort = gadgets.NewOneLiner(ls.grid, "hostname -s")
|
||||
ls.domainname = gadgets.NewOneLiner(ls.grid, "domain name")
|
||||
ls.resolver = gadgets.NewOneLiner(ls.grid, "nameservers =")
|
||||
ls.resolver.SetText("TODO")
|
||||
ls.uid = gadgets.NewOneLiner(ls.grid, "UID =")
|
||||
ls.IPv4 = gadgets.NewOneLiner(ls.grid, "Current IPv4 =")
|
||||
ls.IPv6 = gadgets.NewOneLiner(ls.grid, "Current IPv6 =")
|
||||
ls.workingIPv4 = gadgets.NewOneLiner(ls.grid, "Real IPv4 =")
|
||||
ls.workingIPv6 = gadgets.NewOneLiner(ls.grid, "Real IPv6 =")
|
||||
// ls.nics = gadgets.NewOneLiner(ls.grid, "network intefaces =")
|
||||
|
||||
ls.grid.NewLabel("interfaces =")
|
||||
ls.Interfaces = ls.grid.NewCombobox()
|
||||
|
||||
ls.speed = gadgets.NewOneLiner(ls.grid, "refresh speed =")
|
||||
ls.speedActual = gadgets.NewOneLiner(ls.grid, "refresh speed =")
|
||||
|
||||
ls.grid.Margin()
|
||||
ls.grid.Pad()
|
||||
}
|
||||
|
|
@ -0,0 +1,32 @@
|
|||
package main
|
||||
|
||||
/*
|
||||
https://pkg.go.dev/github.com/miekg/dns#section-readme
|
||||
|
||||
DYNAMIC UPDATES
|
||||
|
||||
Dynamic updates reuses the DNS message format, but renames three of the sections. Question is Zone, Answer is Prerequisite, Authority is Update, only the Additional is not renamed. See RFC 2136 for the gory details.
|
||||
|
||||
You can set a rather complex set of rules for the existence of absence of certain resource records or names in a zone to specify if resource records should be added or removed. The table from RFC 2136 supplemented with the Go DNS function shows which functions exist to specify the prerequisites.
|
||||
|
||||
3.2.4 - Table Of Metavalues Used In Prerequisite Section
|
||||
|
||||
CLASS TYPE RDATA Meaning Function
|
||||
--------------------------------------------------------------
|
||||
ANY ANY empty Name is in use dns.NameUsed
|
||||
ANY rrset empty RRset exists (value indep) dns.RRsetUsed
|
||||
NONE ANY empty Name is not in use dns.NameNotUsed
|
||||
NONE rrset empty RRset does not exist dns.RRsetNotUsed
|
||||
zone rrset rr RRset exists (value dep) dns.Used
|
||||
|
||||
The prerequisite section can also be left empty. If you have decided on the prerequisites you can tell what RRs should be added or deleted. The next table shows the options you have and what functions to call.
|
||||
|
||||
3.4.2.6 - Table Of Metavalues Used In Update Section
|
||||
|
||||
CLASS TYPE RDATA Meaning Function
|
||||
---------------------------------------------------------------
|
||||
ANY ANY empty Delete all RRsets from name dns.RemoveName
|
||||
ANY rrset empty Delete an RRset dns.RemoveRRset
|
||||
NONE rrset rr Delete an RR from RRset dns.Remove
|
||||
zone rrset rr Add to an RRset dns.Insert
|
||||
*/
|
||||
|
|
@ -0,0 +1,76 @@
|
|||
package main
|
||||
|
||||
// Watches for changes to a directory. Works cross-platform
|
||||
|
||||
import (
|
||||
"github.com/fsnotify/fsnotify"
|
||||
)
|
||||
|
||||
// This would be a really dumb way to watch for new network interfaces
|
||||
// since it then watches a linux only directory /sys/class/net for changes
|
||||
|
||||
func watchSysClassNet() {
|
||||
// Create new watcher.
|
||||
watcher, err := fsnotify.NewWatcher()
|
||||
if err != nil {
|
||||
exit(err)
|
||||
}
|
||||
defer watcher.Close()
|
||||
|
||||
// Start listening for events.
|
||||
go func() {
|
||||
for {
|
||||
select {
|
||||
case event, ok := <-watcher.Events:
|
||||
if !ok {
|
||||
return
|
||||
}
|
||||
log("event:", event)
|
||||
if event.Has(fsnotify.Write) {
|
||||
log("modified file:", event.Name)
|
||||
}
|
||||
case err, ok := <-watcher.Errors:
|
||||
if !ok {
|
||||
return
|
||||
}
|
||||
log("error:", err)
|
||||
}
|
||||
}
|
||||
}()
|
||||
|
||||
// Add a path.
|
||||
err = watcher.Add("/tmp")
|
||||
if err != nil {
|
||||
exit(err)
|
||||
}
|
||||
|
||||
// Block main goroutine forever.
|
||||
<-make(chan struct{})
|
||||
}
|
||||
|
||||
func fsnotifyNetworkInterfaceChanges() error {
|
||||
watcher, err := fsnotify.NewWatcher()
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
defer watcher.Close()
|
||||
|
||||
// Watch for network interface changes
|
||||
err = watcher.Add("/sys/class/net")
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
for {
|
||||
select {
|
||||
case event := <-watcher.Events:
|
||||
log("fsnotifyNetworkInterfaceChanges() event =", event)
|
||||
if event.Op&fsnotify.Create == fsnotify.Create {
|
||||
// Do something on network interface creation
|
||||
}
|
||||
case err := <-watcher.Errors:
|
||||
log("fsnotifyNetworkInterfaceChanges() event err =", err)
|
||||
return err
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
|
@ -0,0 +1,57 @@
|
|||
#!/bin/bash -x
|
||||
|
||||
## Tunnel ID: 818143
|
||||
# Creation Date:Feb 12, 2023
|
||||
# Description:
|
||||
# IPv6 Tunnel Endpoints
|
||||
# Server IPv4 Address:184.105.253.14
|
||||
# Server IPv6 Address:2001:470:1f10:2a::1/64
|
||||
# Client IPv4 Address:74.87.91.117
|
||||
# Client IPv6 Address:2001:470:1f10:2a::2/64
|
||||
# Routed IPv6 Prefixes
|
||||
# Routed /64:2001:470:1f11:2a::/64
|
||||
# Routed /48:Assign /48
|
||||
# DNS Resolvers
|
||||
# Anycast IPv6 Caching Nameserver:2001:470:20::2
|
||||
# Anycast IPv4 Caching Nameserver:74.82.42.42
|
||||
# DNS over HTTPS / DNS over TLS:ordns.he.net
|
||||
# rDNS DelegationsEdit
|
||||
# rDNS Delegated NS1:
|
||||
# rDNS Delegated NS2:
|
||||
# rDNS Delegated NS3:
|
||||
# rDNS Delegated NS4:
|
||||
# rDNS Delegated NS5:
|
||||
|
||||
# ifconfig sit0 up
|
||||
# ifconfig sit0 inet6 tunnel ::184.105.253.14
|
||||
# ifconfig sit1 up
|
||||
# ifconfig sit1 inet6 add 2001:470:1f10:2a::2/64
|
||||
# route -A inet6 add ::/0 dev sit1
|
||||
|
||||
if [ "$1" = "down" ]; then
|
||||
ip tunnel del he-ipv6
|
||||
rmmod sit
|
||||
exit
|
||||
fi
|
||||
|
||||
if [ "$1" = "ping" ]; then
|
||||
ping -c 3 2001:470:1f10:13d::1
|
||||
exit
|
||||
fi
|
||||
|
||||
modprobe ipv6
|
||||
ip tunnel add he-ipv6 mode sit remote 184.105.253.14 local 40.132.180.131 ttl 255
|
||||
ip link set he-ipv6 up
|
||||
ip addr add 2001:470:1f10:13d::2/64 dev he-ipv6
|
||||
ip route add ::/0 dev he-ipv6
|
||||
ip -f inet6 addr
|
||||
ifconfig he-ipv6 mtu 1460
|
||||
|
||||
|
||||
# old attempt from the something or pabtz hotel
|
||||
# modprobe ipv6
|
||||
# ip tunnel add he-ipv6 mode sit remote 184.105.253.14 local 74.87.91.117 ttl 255
|
||||
# ip link set he-ipv6 up
|
||||
# ip addr add 2001:470:1f10:2a::2/64 dev he-ipv6
|
||||
# ip route add ::/0 dev he-ipv6
|
||||
# ip -f inet6 addr
|
||||
212
hostname.go
212
hostname.go
|
|
@ -1,195 +1,45 @@
|
|||
// figures out if your hostname is valid
|
||||
// then checks if your DNS is setup correctly
|
||||
package linuxstatus
|
||||
// inspired from:
|
||||
// https://github.com/mactsouk/opensource.com.git
|
||||
// and
|
||||
// https://coderwall.com/p/wohavg/creating-a-simple-tcp-server-in-go
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"io/ioutil"
|
||||
"strings"
|
||||
package main
|
||||
|
||||
"go.wit.com/lib/gui/shell"
|
||||
"go.wit.com/log"
|
||||
// import "net"
|
||||
|
||||
// will try to get this hosts FQDN
|
||||
"github.com/Showmax/go-fqdn"
|
||||
)
|
||||
// will try to get this hosts FQDN
|
||||
import "github.com/Showmax/go-fqdn"
|
||||
|
||||
func (ls *LinuxStatus) GetDomainName() string {
|
||||
if !me.Ready() {
|
||||
return ""
|
||||
}
|
||||
return me.domainname.String()
|
||||
}
|
||||
// this is the king of dns libraries
|
||||
import "github.com/miekg/dns"
|
||||
|
||||
func (ls *LinuxStatus) setDomainName() {
|
||||
if !me.Ready() {
|
||||
return
|
||||
}
|
||||
// dnssec IPv6 socket library
|
||||
import "git.wit.org/jcarr/dnssecsocket"
|
||||
|
||||
dn := run("domainname")
|
||||
if me.domainname.String() != dn {
|
||||
log.Log(CHANGE, "domainname has changed from", me.GetDomainName(), "to", dn)
|
||||
me.domainname.SetText(dn)
|
||||
me.changed = true
|
||||
}
|
||||
}
|
||||
|
||||
func (ls *LinuxStatus) GetHostname() string {
|
||||
if !me.Ready() {
|
||||
return ""
|
||||
}
|
||||
return me.hostname.String()
|
||||
}
|
||||
|
||||
func (ls *LinuxStatus) ValidHostname() bool {
|
||||
if !me.Ready() {
|
||||
log.Info("ValidHostname() not ready")
|
||||
return false
|
||||
}
|
||||
if me.hostnameStatus.String() == "WORKING" {
|
||||
return true
|
||||
}
|
||||
return false
|
||||
}
|
||||
|
||||
func (ls *LinuxStatus) setHostname(newname string) {
|
||||
if !me.Ready() {
|
||||
return
|
||||
}
|
||||
if newname == me.hostname.String() {
|
||||
return
|
||||
}
|
||||
log.Log(CHANGE, "hostname has changed from", me.GetHostname(), "to", newname)
|
||||
me.hostname.SetText(newname)
|
||||
me.changed = true
|
||||
}
|
||||
|
||||
func (ls *LinuxStatus) GetHostShort() string {
|
||||
if !me.Ready() {
|
||||
return ""
|
||||
}
|
||||
return me.hostshort.String()
|
||||
}
|
||||
|
||||
func (ls *LinuxStatus) setHostShort() {
|
||||
if !me.Ready() {
|
||||
return
|
||||
}
|
||||
hshort := run("hostname -s")
|
||||
if me.hostshort.String() != hshort {
|
||||
log.Log(CHANGE, "hostname -s has changed from", me.hostshort.String(), "to", hshort)
|
||||
me.hostshort.SetText(hshort)
|
||||
me.changed = true
|
||||
}
|
||||
}
|
||||
|
||||
// getDomainName extracts the domain name from a given hostname
|
||||
func getDomainName(hostname string) (string, error) {
|
||||
parts := strings.Split(hostname, ".")
|
||||
if len(parts) < 3 {
|
||||
return "", fmt.Errorf("hostname '%s' is too short to extract a domain name", hostname)
|
||||
}
|
||||
// Join all parts except the first one, which is assumed to be a subdomain
|
||||
domain := strings.Join(parts[1:], ".")
|
||||
return domain, nil
|
||||
}
|
||||
|
||||
func lookupHostname() {
|
||||
if !me.Ready() {
|
||||
return
|
||||
}
|
||||
func getHostname() {
|
||||
var err error
|
||||
var hostfqdn string = "broken"
|
||||
hostfqdn, err = fqdn.FqdnHostname()
|
||||
if err != nil {
|
||||
log.Error(err, "FQDN hostname error")
|
||||
me.fqdn, err = fqdn.FqdnHostname()
|
||||
if (err != nil) {
|
||||
log("FQDN hostname error =", err)
|
||||
exit()
|
||||
return
|
||||
}
|
||||
log.Log(NET, "full hostname should be: ", hostfqdn)
|
||||
log("FQDN hostname is", me.fqdn)
|
||||
|
||||
me.setDomainName()
|
||||
me.setHostShort()
|
||||
|
||||
// these are authoritative
|
||||
// if they work wrong, your linux configuration is wrong.
|
||||
// Do not complain.
|
||||
// Fix your distro if your box is otherwise not working this way
|
||||
hshort := me.GetHostShort() // from `hostname -s`
|
||||
dn := me.GetDomainName() // from `domanname`
|
||||
hostname := me.GetHostname() // from `hostname -f`
|
||||
|
||||
if hostfqdn != hostname {
|
||||
log.Log(WARN, "hostname", hostname, "does not equal fqdn.FqdnHostname()", hostfqdn)
|
||||
// TODO: figure out what is wrong
|
||||
if dn == "(none)" {
|
||||
realdn, err := getDomainName(hostfqdn)
|
||||
if err == nil {
|
||||
log.Log(WARN, "need to run: 'domainname", realdn, "' here")
|
||||
me.changed = true
|
||||
me.hostnameStatus.SetText("FIXING")
|
||||
shell.Run([]string{"domainname", realdn})
|
||||
return
|
||||
} else {
|
||||
log.Log(WARN, "getDomainName() err =", err)
|
||||
log.Log(WARN, "/etc/hostname is too short. let the user set the name here.")
|
||||
// me.changed = true
|
||||
me.hostnameStatus.SetText("INVALID DOMAIN NAME")
|
||||
// return
|
||||
}
|
||||
}
|
||||
log.Log(WARN, "don't know what to do here with domainname")
|
||||
log.Log(WARN, "check that /etc/hostname is valid?")
|
||||
// me.changed = true
|
||||
me.hostnameStatus.SetText("UNKNOWN")
|
||||
// return
|
||||
}
|
||||
|
||||
var test string
|
||||
test = hshort + "." + dn
|
||||
|
||||
me.setHostname(test)
|
||||
|
||||
if hostname != test {
|
||||
log.Log(CHANGE, "hostname", hostname, "does not equal", test)
|
||||
if me.hostnameStatus.String() != "BROKEN" {
|
||||
log.Log(CHANGE, "hostname", hostname, "does not equal", test)
|
||||
me.changed = true
|
||||
me.hostnameStatus.SetText("BROKEN")
|
||||
}
|
||||
} else {
|
||||
if me.hostnameStatus.String() != "WORKING" {
|
||||
log.Log(CHANGE, "hostname", hostname, "is valid")
|
||||
me.hostnameStatus.SetText("WORKING")
|
||||
me.changed = true
|
||||
}
|
||||
}
|
||||
var aaaa []string
|
||||
aaaa = getAAAA(me.fqdn)
|
||||
log("AAAA =", aaaa)
|
||||
}
|
||||
|
||||
// returns true if the hostname is good
|
||||
// check that all the OS settings are correct here
|
||||
// On Linux, /etc/hosts, /etc/hostname
|
||||
//
|
||||
// and domainname and hostname
|
||||
func goodHostname() bool {
|
||||
content, err := ioutil.ReadFile("/etc/hostname")
|
||||
if err != nil {
|
||||
// this needs to be a fixWindow() error
|
||||
log.Error(err)
|
||||
func getAAAA(s string) []string {
|
||||
// lookup the IP address from DNS
|
||||
dnsRR := dnssecsocket.Dnstrace(s, "AAAA")
|
||||
log(args.VerboseDNS, SPEW, dnsRR)
|
||||
if (dnsRR == nil) {
|
||||
return nil
|
||||
}
|
||||
|
||||
hostname := string(content)
|
||||
|
||||
log.Log(NOW, "hostname =", hostname)
|
||||
|
||||
hs := run("hostname -s")
|
||||
dn := run("domainname")
|
||||
log.Log(NOW, "hostname short =", hs, "domainname =", dn)
|
||||
|
||||
tmp := hs + "." + dn
|
||||
if hostname == tmp {
|
||||
log.Log(NOW, "hostname seems to be good", hostname)
|
||||
return true
|
||||
}
|
||||
|
||||
return false
|
||||
ipaddr1 := dns.Field(dnsRR, 1)
|
||||
ipaddr2 := dns.Field(dnsRR, 2)
|
||||
log("ipaddr", ipaddr1, ipaddr2)
|
||||
return []string{ipaddr1, ipaddr2}
|
||||
}
|
||||
|
|
|
|||
99
linuxloop.go
99
linuxloop.go
|
|
@ -1,99 +0,0 @@
|
|||
// GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007
|
||||
// Copyright (c) 2023 WIT.COM, Inc.
|
||||
|
||||
// This is a control panel for DNS
|
||||
|
||||
// This is the main Linux kernel / OS code
|
||||
// to check your network settings are correct
|
||||
// This does (and should do) no network or external checking
|
||||
// This is just the state of your OS
|
||||
|
||||
package linuxstatus
|
||||
|
||||
import (
|
||||
"io/ioutil"
|
||||
"os"
|
||||
"os/user"
|
||||
"sort"
|
||||
"strconv"
|
||||
"strings"
|
||||
|
||||
"go.wit.com/log"
|
||||
)
|
||||
|
||||
func linuxLoop() {
|
||||
me.changed = false
|
||||
|
||||
// checks for a VALID hostname
|
||||
lookupHostname()
|
||||
if me.changed {
|
||||
log.Log(CHANGE, "lookupHostname() detected a change")
|
||||
}
|
||||
|
||||
// scans the linux network intefaces for your available IPv4 & IPv6 addresses
|
||||
scanInterfaces()
|
||||
if me.changed {
|
||||
log.Log(CHANGE, "scanInterfaces() detected a change")
|
||||
}
|
||||
for i, t := range me.ifmap {
|
||||
log.Log(NET, strconv.Itoa(i)+" iface = "+t.iface.Name)
|
||||
}
|
||||
|
||||
// get all the real A records from all the network interfaces linux can see
|
||||
a := realA()
|
||||
sort.Strings(a)
|
||||
tmp := strings.Join(a, "\n")
|
||||
if tmp != me.workingIPv4.String() {
|
||||
log.Log(CHANGE, "realA() your real IPv6 addresses changed")
|
||||
me.changed = true
|
||||
me.workingIPv4.SetText(tmp)
|
||||
}
|
||||
|
||||
// get all the real AAAA records from all the network interfaces linux can see
|
||||
aaaa := realAAAA()
|
||||
sort.Strings(aaaa)
|
||||
tmp = strings.Join(aaaa, "\n")
|
||||
if tmp != me.workingIPv6.String() {
|
||||
log.Log(CHANGE, "realAAAA() your real IPv6 addresses changed")
|
||||
me.changed = true
|
||||
me.workingIPv6.SetText(tmp)
|
||||
}
|
||||
|
||||
user, _ := user.Current()
|
||||
tmp = user.Username + " (" + strconv.Itoa(os.Getuid()) + ")"
|
||||
if tmp != me.uid.String() {
|
||||
log.Log(CHANGE, "os.Getuid =", user.Username, os.Getuid())
|
||||
me.changed = true
|
||||
me.uid.SetText(tmp)
|
||||
}
|
||||
|
||||
content, _ := ioutil.ReadFile("/etc/resolv.conf")
|
||||
var ns []string
|
||||
for _, line := range strings.Split(string(content), "\n") {
|
||||
parts := strings.Split(line, " ")
|
||||
if len(parts) > 1 {
|
||||
if parts[0] == "nameserver" {
|
||||
ns = append(ns, parts[1])
|
||||
}
|
||||
}
|
||||
}
|
||||
sort.Strings(ns)
|
||||
newNS := strings.Join(ns, "\n")
|
||||
if newNS != me.resolver.String() {
|
||||
log.Log(CHANGE, "resolver changed in /etc/resolv.conf to", ns)
|
||||
me.changed = true
|
||||
me.resolver.SetText(newNS)
|
||||
}
|
||||
|
||||
/*
|
||||
processName := getProcessNameByPort(53)
|
||||
fmt.Println("Process with port 53:", processName)
|
||||
|
||||
commPath := filepath.Join("/proc", proc.Name(), "comm")
|
||||
comm, err := ioutil.ReadFile(commPath)
|
||||
if err != nil {
|
||||
return "", err // Error reading the process name
|
||||
}
|
||||
return strings.TrimSpace(string(comm)), nil
|
||||
*/
|
||||
}
|
||||
|
|
@ -0,0 +1,103 @@
|
|||
// I like things to be easy. Why can't the standard language be like this?
|
||||
|
||||
package main
|
||||
|
||||
import (
|
||||
"os"
|
||||
golog "log"
|
||||
"time"
|
||||
"reflect"
|
||||
"github.com/davecgh/go-spew/spew"
|
||||
// "net"
|
||||
)
|
||||
|
||||
var LOGOFF bool = false // turn this off, all logging stops
|
||||
var WARN bool
|
||||
var INFO bool
|
||||
|
||||
type spewt struct {
|
||||
a bool
|
||||
}
|
||||
|
||||
var SPEW spewt
|
||||
|
||||
|
||||
/*
|
||||
sleep() # you know what this does? sleeps for 1 second. yep. dump. easy.
|
||||
sleep(.1) # you know what this does? yes, it sleeps for 1/10th of a second
|
||||
*/
|
||||
func sleep(a ...any) {
|
||||
if (a == nil) {
|
||||
time.Sleep(time.Second)
|
||||
return
|
||||
}
|
||||
|
||||
log(args.Verbose, "sleep", a[0])
|
||||
|
||||
switch a[0].(type) {
|
||||
case int:
|
||||
time.Sleep(time.Duration(a[0].(int)) * time.Second)
|
||||
case float64:
|
||||
time.Sleep(time.Duration(a[0].(float64) * 1000) * time.Millisecond)
|
||||
default:
|
||||
log("sleep a[0], type = ", a[0], reflect.TypeOf(a[0]))
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
exit() # yep. exits. I guess everything must be fine
|
||||
exit(3) # I guess 3 it is then
|
||||
exit("dont like apples") # ok. I'll make a note of that
|
||||
*/
|
||||
func exit(a ...any) {
|
||||
log("exit", a)
|
||||
//if (a) {
|
||||
// os.Exit(a)
|
||||
//}
|
||||
os.Exit(0)
|
||||
}
|
||||
|
||||
/*
|
||||
I've spent, am spending, too much time thinking about 'logging'. 'log', 'logrus', 'zap', whatever.
|
||||
I'm not twitter. i don't give a fuck about how many nanoseconds it takes to log. Anyway, this
|
||||
implementation is probably faster than all of those because you just set one bool to FALSE
|
||||
and it all stops.
|
||||
Sometimes I need to capture to stdout, sometimes stdout can't
|
||||
work because it doesn't exist for the user. This whole thing is a PITA. Then it's spread
|
||||
over 8 million references in every .go file. I'm tapping out and putting
|
||||
it in one place. here it is. Also, this makes having debug levels really fucking easy.
|
||||
You can define whatever level of logging you want from anywhere (command line) etc.
|
||||
|
||||
log() # doesn't do anything
|
||||
log(stuff) # sends it to whatever log you define in a single place. here is the place
|
||||
*/
|
||||
|
||||
func log(a ...any) {
|
||||
if (LOGOFF) {
|
||||
return
|
||||
}
|
||||
|
||||
if (a == nil) {
|
||||
return
|
||||
}
|
||||
var blah bool
|
||||
if (reflect.TypeOf(a[0]) == reflect.TypeOf(blah)) {
|
||||
// golog.Println("\t a[0] = bool")
|
||||
if (a[0] == false) {
|
||||
return
|
||||
}
|
||||
a = a[1:]
|
||||
}
|
||||
|
||||
if (reflect.TypeOf(a[0]) == reflect.TypeOf(SPEW)) {
|
||||
a = a[1:]
|
||||
spew.Dump(a)
|
||||
return
|
||||
}
|
||||
|
||||
golog.Println(a...)
|
||||
// golog.Println("\t a[0] =", a[0])
|
||||
// for argNum, arg := range a {
|
||||
// golog.Println("\t", argNum, arg)
|
||||
// }
|
||||
}
|
||||
|
|
@ -0,0 +1,32 @@
|
|||
package main
|
||||
|
||||
/*
|
||||
import "log"
|
||||
import "github.com/miekg/dns"
|
||||
|
||||
import "git.wit.org/jcarr/dnssecsocket"
|
||||
|
||||
import "github.com/davecgh/go-spew/spew"
|
||||
// import "github.com/Showmax/go-fqdn"
|
||||
|
||||
func lookupAAAA(hostname string) string {
|
||||
// lookup the IP address from DNS
|
||||
dnsRR := dnssecsocket.Dnstrace(hostname, "AAAA")
|
||||
spew.Dump(dnsRR)
|
||||
if (dnsRR == nil) {
|
||||
return "BROKEN"
|
||||
}
|
||||
ipaddr := dns.Field(dnsRR, 1)
|
||||
log.Println("ipaddr", ipaddr)
|
||||
return ipaddr
|
||||
}
|
||||
*/
|
||||
|
||||
/*
|
||||
func main() {
|
||||
hostname := "check.lab.wit.org"
|
||||
// 2604:bbc0:2:248:5054:f0ff:fe00:156
|
||||
|
||||
lookupAAAA(hostname)
|
||||
}
|
||||
*/
|
||||
252
net.go
252
net.go
|
|
@ -1,86 +1,102 @@
|
|||
// This creates a simple hello world window
|
||||
package linuxstatus
|
||||
package main
|
||||
|
||||
import (
|
||||
// "log"
|
||||
import (
|
||||
"net"
|
||||
"sort"
|
||||
"strings"
|
||||
|
||||
"go.wit.com/log"
|
||||
// "git.wit.org/wit/gui"
|
||||
)
|
||||
|
||||
var DEBUGNET bool = false
|
||||
|
||||
// this doesn't work
|
||||
/*
|
||||
func watchNetworkInterfaces() {
|
||||
// Get list of network interfaces
|
||||
interfaces, _ := net.Interfaces()
|
||||
|
||||
// Set up a notification channel
|
||||
notification := make(chan net.Interface)
|
||||
|
||||
log(DEBUGNET, "watchNet()")
|
||||
// Start goroutine to watch for changes
|
||||
go func() {
|
||||
log(DEBUGNET, "watchNet() func")
|
||||
for {
|
||||
log(DEBUGNET, "forever loop start")
|
||||
// Check for changes in each interface
|
||||
for _, i := range interfaces {
|
||||
log(DEBUGNET, "something on i =", i)
|
||||
if status := i.Flags & net.FlagUp; status != 0 {
|
||||
notification <- i
|
||||
log(DEBUGNET, "something on i =", i)
|
||||
}
|
||||
}
|
||||
log(DEBUGNET, "forever loop end")
|
||||
}
|
||||
}()
|
||||
}
|
||||
*/
|
||||
|
||||
func IsIPv6(address string) bool {
|
||||
return strings.Count(address, ":") >= 2
|
||||
}
|
||||
|
||||
func (t *IPtype) IsReal() bool {
|
||||
if t.ip.IsPrivate() || t.ip.IsLoopback() || t.ip.IsLinkLocalUnicast() {
|
||||
log.Log(NET, "\t\tIP is Real = false")
|
||||
if (t.ip.IsPrivate() || t.ip.IsLoopback() || t.ip.IsLinkLocalUnicast()) {
|
||||
log(DEBUGNET, "\t\tIP is Real = false")
|
||||
return false
|
||||
} else {
|
||||
log.Log(NET, "\t\tIP is Real = true")
|
||||
log(DEBUGNET, "\t\tIP is Real = true")
|
||||
return true
|
||||
}
|
||||
}
|
||||
|
||||
func IsReal(ip *net.IP) bool {
|
||||
if ip.IsPrivate() || ip.IsLoopback() || ip.IsLinkLocalUnicast() {
|
||||
log.Log(NET, "\t\tIP is Real = false")
|
||||
if (ip.IsPrivate() || ip.IsLoopback() || ip.IsLinkLocalUnicast()) {
|
||||
log(DEBUGNET, "\t\tIP is Real = false")
|
||||
return false
|
||||
} else {
|
||||
log.Log(NET, "\t\tIP is Real = true")
|
||||
log(DEBUGNET, "\t\tIP is Real = true")
|
||||
return true
|
||||
}
|
||||
}
|
||||
|
||||
func renameInterface(i *net.Interface) {
|
||||
/*
|
||||
/sbin/ip link set eth1 down
|
||||
/sbin/ip link set eth1 name eth123
|
||||
/sbin/ip link set eth123 up
|
||||
/sbin/ip link set eth1 down
|
||||
/sbin/ip link set eth1 name eth123
|
||||
/sbin/ip link set eth123 up
|
||||
*/
|
||||
}
|
||||
|
||||
// Will figure out if an interface was just added
|
||||
func checkInterface(i net.Interface) {
|
||||
val, ok := me.ifmap[i.Index]
|
||||
if !ok {
|
||||
log.Log(INFO, i.Name, "is a new network interface. The linux kernel index =", i.Index)
|
||||
if ! ok {
|
||||
log(i.Name, "is a new network interface. The linux kernel index =", i.Index)
|
||||
me.ifmap[i.Index] = new(IFtype)
|
||||
me.ifmap[i.Index].gone = false
|
||||
me.ifmap[i.Index].iface = &i
|
||||
me.changed = true
|
||||
if me.Interfaces != nil {
|
||||
me.Interfaces.AddText(i.Name)
|
||||
me.Interfaces.SetText(i.Name)
|
||||
}
|
||||
me.ipchange = true
|
||||
return
|
||||
}
|
||||
me.ifmap[i.Index].gone = false
|
||||
log.Log(NET, "me.ifmap[i] does exist. Need to compare everything.", i.Index, i.Name, val.iface.Index, val.iface.Name)
|
||||
if val.iface.Name != i.Name {
|
||||
log.Log(INFO, val.iface.Name, "has changed to it's name to", i.Name)
|
||||
log(args.VerboseNet, "me.ifmap[i] does exist. Need to compare everything.", i.Index, i.Name, val.iface.Index, val.iface.Name)
|
||||
if (val.iface.Name != i.Name) {
|
||||
log(val.iface.Name, "has changed to it's name to", i.Name)
|
||||
me.ifmap[i.Index].iface = &i
|
||||
me.changed = true
|
||||
if me.Interfaces != nil {
|
||||
me.Interfaces.AddText(i.Name)
|
||||
me.Interfaces.SetText(i.Name)
|
||||
}
|
||||
me.ipchange = true
|
||||
return
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
These are the real IP address you have been
|
||||
given from DHCP
|
||||
*/
|
||||
func realAAAA() []string {
|
||||
var aaaa []string
|
||||
|
||||
for s, t := range me.ipmap {
|
||||
if t.IsReal() {
|
||||
if t.ipv6 {
|
||||
if (t.IsReal()) {
|
||||
if (t.ipv6) {
|
||||
aaaa = append(aaaa, s)
|
||||
}
|
||||
}
|
||||
|
|
@ -88,20 +104,7 @@ func realAAAA() []string {
|
|||
return aaaa
|
||||
}
|
||||
|
||||
func realA() []string {
|
||||
var a []string
|
||||
|
||||
for s, t := range me.ipmap {
|
||||
if t.IsReal() {
|
||||
if t.ipv4 {
|
||||
a = append(a, s)
|
||||
}
|
||||
}
|
||||
}
|
||||
return a
|
||||
}
|
||||
|
||||
func checkDNSOld() (map[string]*IPtype, map[string]*IPtype) {
|
||||
func checkDNS() (map[string]*IPtype, map[string]*IPtype) {
|
||||
var ipv4s map[string]*IPtype
|
||||
var ipv6s map[string]*IPtype
|
||||
|
||||
|
|
@ -111,18 +114,18 @@ func checkDNSOld() (map[string]*IPtype, map[string]*IPtype) {
|
|||
for s, t := range me.ipmap {
|
||||
i := t.iface
|
||||
ipt := "IPv4"
|
||||
if t.ipv6 {
|
||||
if (t.ipv6) {
|
||||
ipt = "IPv6"
|
||||
}
|
||||
if t.IsReal() {
|
||||
log.Log(INFO, "\tIP is Real ", ipt, i.Index, i.Name, s)
|
||||
if t.ipv6 {
|
||||
if (t.IsReal()) {
|
||||
log("\tIP is Real ", ipt, i.Index, i.Name, s)
|
||||
if (t.ipv6) {
|
||||
ipv6s[s] = t
|
||||
} else {
|
||||
ipv4s[s] = t
|
||||
}
|
||||
} else {
|
||||
log.Log(INFO, "\tIP is not Real", ipt, i.Index, i.Name, s)
|
||||
log("\tIP is not Real", ipt, i.Index, i.Name, s)
|
||||
}
|
||||
}
|
||||
return ipv6s, ipv4s
|
||||
|
|
@ -130,14 +133,14 @@ func checkDNSOld() (map[string]*IPtype, map[string]*IPtype) {
|
|||
|
||||
// Will figure out if an IP address is new
|
||||
func checkIP(ip *net.IPNet, i net.Interface) bool {
|
||||
log.Log(NET, "\t\taddr.(type) = *net.IPNet")
|
||||
log.Log(NET, "\t\taddr.(type) =", ip)
|
||||
log(args.VerboseNet, "\t\taddr.(type) = *net.IPNet")
|
||||
log(args.VerboseNet, "\t\taddr.(type) =", ip)
|
||||
var realip string
|
||||
realip = ip.IP.String()
|
||||
|
||||
val, ok := me.ipmap[realip]
|
||||
if ok {
|
||||
log.Log(NET, val.ipnet.IP.String(), "is already a defined IP address")
|
||||
log(args.VerboseNet, val.ipnet.IP.String(), "is already a defined IP address")
|
||||
me.ipmap[realip].gone = false
|
||||
return false
|
||||
}
|
||||
|
|
@ -149,147 +152,72 @@ func checkIP(ip *net.IPNet, i net.Interface) bool {
|
|||
me.ipmap[realip].ip = ip.IP
|
||||
me.ipmap[realip].iface = &i
|
||||
t := "IPv4"
|
||||
if IsIPv6(ip.String()) {
|
||||
if (IsIPv6(ip.String())) {
|
||||
me.ipmap[realip].ipv6 = true
|
||||
me.ipmap[realip].ipv4 = false
|
||||
t = "IPv6"
|
||||
if me.IPv6 != nil {
|
||||
me.IPv6.SetText(realip)
|
||||
}
|
||||
} else {
|
||||
me.ipmap[realip].ipv6 = false
|
||||
me.ipmap[realip].ipv4 = true
|
||||
if me.IPv4 != nil {
|
||||
me.IPv4.SetText(realip)
|
||||
}
|
||||
}
|
||||
if IsReal(&ip.IP) {
|
||||
log.Log(INFO, "\tIP is Real ", t, i.Index, i.Name, realip)
|
||||
if (IsReal(&ip.IP)) {
|
||||
log("\tIP is Real ", t, i.Index, i.Name, realip)
|
||||
} else {
|
||||
log.Log(INFO, "\tIP is not Real", t, i.Index, i.Name, realip)
|
||||
log("\tIP is not Real", t, i.Index, i.Name, realip)
|
||||
}
|
||||
log.Log(NET, "\t\tIP is IsPrivate() =", ip.IP.IsPrivate())
|
||||
log.Log(NET, "\t\tIP is IsLoopback() =", ip.IP.IsLoopback())
|
||||
log.Log(NET, "\t\tIP is IsLinkLocalUnicast() =", ip.IP.IsLinkLocalUnicast())
|
||||
// log.Log(INFO, "HERE HERE", "realip =", realip, "me.ip[realip]=", me.ipmap[realip])
|
||||
log(args.VerboseNet, "\t\tIP is IsPrivate() =", ip.IP.IsPrivate())
|
||||
log(args.VerboseNet, "\t\tIP is IsLoopback() =", ip.IP.IsLoopback())
|
||||
log(args.VerboseNet, "\t\tIP is IsLinkLocalUnicast() =", ip.IP.IsLinkLocalUnicast())
|
||||
// log("HERE HERE", "realip =", realip, "me.ip[realip]=", me.ipmap[realip])
|
||||
return true
|
||||
}
|
||||
|
||||
func scanInterfaces() {
|
||||
log.Log(NET, "scanInterfaces() START")
|
||||
me.ipchange = false
|
||||
ifaces, _ := net.Interfaces()
|
||||
// me.ifnew = ifaces
|
||||
log.Log(NET, SPEW, ifaces)
|
||||
log(DEBUGNET, SPEW, ifaces)
|
||||
for _, i := range ifaces {
|
||||
addrs, _ := i.Addrs()
|
||||
// log.Log(INFO, "range ifaces = ", i)
|
||||
// log("range ifaces = ", i)
|
||||
checkInterface(i)
|
||||
log.Log(NET, "*net.Interface.Name = ", i.Name, i.Index)
|
||||
log.Log(NET, SPEW, i)
|
||||
log.Log(NET, SPEW, addrs)
|
||||
log(args.VerboseNet, "*net.Interface.Name = ", i.Name, i.Index)
|
||||
log(args.VerboseNet, SPEW, i)
|
||||
log(DEBUGNET, SPEW, addrs)
|
||||
for _, addr := range addrs {
|
||||
log.Log(NET, "\taddr =", addr)
|
||||
log.Log(NET, SPEW, addrs)
|
||||
log(DEBUGNET, "\taddr =", addr)
|
||||
log(DEBUGNET, SPEW, addrs)
|
||||
ips, _ := net.LookupIP(addr.String())
|
||||
log.Log(NET, "\tLookupIP(addr) =", ips)
|
||||
log(DEBUGNET, "\tLookupIP(addr) =", ips)
|
||||
switch v := addr.(type) {
|
||||
case *net.IPNet:
|
||||
if checkIP(v, i) {
|
||||
log.Log(NET, "scanInterfaces() IP is new () i =", v.IP.String())
|
||||
}
|
||||
checkIP(v, i)
|
||||
// log("\t\tIP is () =", ip.())
|
||||
default:
|
||||
log.Log(NET, "\t\taddr.(type) = NO IDEA WHAT TO DO HERE v =", v)
|
||||
log(DEBUGNET, "\t\taddr.(type) = NO IDEA WHAT TO DO HERE v =", v)
|
||||
}
|
||||
}
|
||||
}
|
||||
if deleteChanges() {
|
||||
me.changed = true
|
||||
log.Log(NET, "deleteChanges() detected network changes")
|
||||
}
|
||||
updateRealAAAA()
|
||||
log.Log(NET, "scanInterfaces() END")
|
||||
}
|
||||
|
||||
// displays the IP address found on your network interfaces
|
||||
func updateRealAAAA() {
|
||||
var all4 []string
|
||||
var all6 []string
|
||||
for s, t := range me.ipmap {
|
||||
if t.ipv4 {
|
||||
all4 = append(all4, s)
|
||||
log.Log(NET, "IPv4 =", s)
|
||||
} else if t.ipv6 {
|
||||
all6 = append(all6, s)
|
||||
log.Log(NET, "IPv6 =", s)
|
||||
} else {
|
||||
log.Log(NET, "???? =", s)
|
||||
}
|
||||
}
|
||||
|
||||
// sort and create text
|
||||
sort.Strings(all4)
|
||||
sort.Strings(all6)
|
||||
s4 := strings.Join(all4, "\n")
|
||||
s6 := strings.Join(all6, "\n")
|
||||
|
||||
if me.IPv4.String() != s4 {
|
||||
log.Log(CHANGE, "IPv4 addresses have changed", s4)
|
||||
me.IPv4.SetText(s4)
|
||||
me.changed = true
|
||||
}
|
||||
if me.IPv6.String() != s6 {
|
||||
log.Log(CHANGE, "IPv6 addresses have changed", s6)
|
||||
me.IPv6.SetText(s6)
|
||||
me.changed = true
|
||||
}
|
||||
deleteChanges()
|
||||
}
|
||||
|
||||
// delete network interfaces and ip addresses from the gui
|
||||
func deleteChanges() bool {
|
||||
var changed bool = false
|
||||
func deleteChanges() {
|
||||
for i, t := range me.ifmap {
|
||||
if t.gone {
|
||||
log.Log(CHANGE, "DELETE int =", i, "name =", t.name, t.iface)
|
||||
if (t.gone) {
|
||||
log("DELETE int =", i, "name =", t.name, t.iface)
|
||||
delete(me.ifmap, i)
|
||||
changed = true
|
||||
}
|
||||
t.gone = true
|
||||
}
|
||||
for s, t := range me.ipmap {
|
||||
if t.gone {
|
||||
log.Log(CHANGE, "DELETE name =", s, "IPv4 =", t.ipv4)
|
||||
log.Log(CHANGE, "DELETE name =", s, "IPv6 =", t.ipv6)
|
||||
log.Log(CHANGE, "DELETE name =", s, "iface =", t.iface)
|
||||
log.Log(CHANGE, "DELETE name =", s, "ip =", t.ip)
|
||||
if (t.gone) {
|
||||
log("DELETE name =", s, "IPv4 =", t.ipv4)
|
||||
log("DELETE name =", s, "IPv6 =", t.ipv6)
|
||||
log("DELETE name =", s, "iface =", t.iface)
|
||||
log("DELETE name =", s, "ip =", t.ip)
|
||||
delete(me.ipmap, s)
|
||||
changed = true
|
||||
}
|
||||
t.gone = true
|
||||
}
|
||||
|
||||
return changed
|
||||
}
|
||||
|
||||
func (ls *LinuxStatus) GetIPv6() []string {
|
||||
if !me.Ready() {
|
||||
return nil
|
||||
}
|
||||
tmp := me.workingIPv6.String()
|
||||
return strings.Split(tmp, "\n")
|
||||
}
|
||||
|
||||
func (ls *LinuxStatus) GetIPv4() []string {
|
||||
if !me.Ready() {
|
||||
return nil
|
||||
}
|
||||
tmp := me.workingIPv4.String()
|
||||
return strings.Split(tmp, "\n")
|
||||
}
|
||||
|
||||
func (ls *LinuxStatus) GetNameservers() []string {
|
||||
if !me.Ready() {
|
||||
return nil
|
||||
}
|
||||
tmp := me.resolver.String()
|
||||
return strings.Split(tmp, "\n")
|
||||
}
|
||||
|
|
|
|||
|
|
@ -0,0 +1,66 @@
|
|||
package main
|
||||
|
||||
// examples of what ifconfig does
|
||||
// example of AF_NETLINK change:
|
||||
// https://stackoverflow.com/questions/579783/how-to-detect-ip-address-change-programmatically-in-linux/2353441#2353441
|
||||
// from that page, a link to watch for any ip event:
|
||||
// https://github.com/angt/ipevent/blob/master/ipevent.c
|
||||
|
||||
// https://github.com/mdlayher/talks : Linux, Netlink, and Go in 7 minutes or less! (GopherCon 2018, lightning talk)
|
||||
|
||||
/*
|
||||
c example from ipevent.c :
|
||||
int fd = socket(PF_NETLINK, SOCK_RAW, NETLINK_ROUTE);
|
||||
|
||||
struct sockaddr_nl snl = {
|
||||
.nl_family = AF_NETLINK,
|
||||
.nl_groups = RTMGRP_IPV4_IFADDR | RTMGRP_IPV6_IFADDR,
|
||||
};
|
||||
*/
|
||||
|
||||
/*
|
||||
import (
|
||||
// "os"
|
||||
// "os/exec"
|
||||
// "log"
|
||||
// "net"
|
||||
// "unix"
|
||||
"github.com/vishvananda/netlink"
|
||||
"github.com/jsimonetti/rtnetlink"
|
||||
// "git.wit.org/wit/gui"
|
||||
// "github.com/davecgh/go-spew/spew"
|
||||
)
|
||||
|
||||
// In golang, write a function to register with netlink to detect changes to any network interface Use tab indentation. Do not include example usage.
|
||||
|
||||
func registerNetlink() error {
|
||||
// Create netlink socket
|
||||
sock, err := netlink.Socket(rtnetlink.NETLINK_ROUTE, 0)
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
// Register for interface change events
|
||||
err = netlink.AddMembership(sock, netlink.RTNLGRP_LINK)
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
// Close the socket
|
||||
defer sock.Close()
|
||||
// Handle incoming notifications
|
||||
for {
|
||||
msgs, _, err := sock.Receive()
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
for _, msg := range msgs {
|
||||
switch msg.Header.Type {
|
||||
case unix.RTM_NEWLINK:
|
||||
// Do something with new link
|
||||
case unix.RTM_DELLINK:
|
||||
// Do something with deleted link
|
||||
}
|
||||
}
|
||||
}
|
||||
return nil
|
||||
}
|
||||
*/
|
||||
29
new.go
29
new.go
|
|
@ -1,29 +0,0 @@
|
|||
// This creates a simple hello world window
|
||||
package linuxstatus
|
||||
|
||||
import (
|
||||
"go.wit.com/log"
|
||||
|
||||
"go.wit.com/lib/gadgets"
|
||||
)
|
||||
|
||||
func InitLinuxStatus() *LinuxStatus {
|
||||
if me != nil {
|
||||
log.Log(WARN, "You have done New() twice. You can only do this once")
|
||||
return me
|
||||
}
|
||||
me = &LinuxStatus{
|
||||
hidden: true,
|
||||
ready: false,
|
||||
}
|
||||
me.ifmap = make(map[int]*IFtype)
|
||||
me.ipmap = make(map[string]*IPtype)
|
||||
|
||||
log.Log(WARN, "Creating the Window")
|
||||
me.window = gadgets.RawBasicWindow("OS Hostname Details")
|
||||
me.window.Make()
|
||||
draw(me)
|
||||
|
||||
me.ready = true
|
||||
return me
|
||||
}
|
||||
101
proc.go
101
proc.go
|
|
@ -1,101 +0,0 @@
|
|||
package linuxstatus
|
||||
|
||||
import (
|
||||
"io/ioutil"
|
||||
"os"
|
||||
"path/filepath"
|
||||
"strconv"
|
||||
"strings"
|
||||
|
||||
"go.wit.com/log"
|
||||
)
|
||||
|
||||
func GetProcessNameByPort(port int) string {
|
||||
// Convert port to hex string
|
||||
portHex := strconv.FormatInt(int64(port), 16)
|
||||
|
||||
// Function to search /proc/net/tcp or /proc/net/udp
|
||||
searchProcNet := func(file string) string {
|
||||
data, err := ioutil.ReadFile(file)
|
||||
if err != nil {
|
||||
return ""
|
||||
}
|
||||
// log.Log(PROC, "searchProcNet() data:", string(data))
|
||||
|
||||
lines := strings.Split(string(data), "\n")
|
||||
for _, line := range lines {
|
||||
fields := strings.Fields(line)
|
||||
log.Log(PROC, "searchProcNet() portHex:", portHex)
|
||||
if len(fields) > 9 {
|
||||
log.Log(PROC, "searchProcNet() fields[9]", fields[9])
|
||||
}
|
||||
log.Log(PROC, "searchProcNet() lines:", line)
|
||||
if len(fields) > 1 {
|
||||
parts := strings.Split(fields[1], ":")
|
||||
if len(parts) > 1 {
|
||||
// Convert the hexadecimal string to an integer
|
||||
value, _ := strconv.ParseInt(parts[1], 16, 64)
|
||||
log.Log(PROC, "searchProcNet() value, port =", value, port, "parts[1] =", parts[1])
|
||||
if port == int(value) {
|
||||
log.Log(PROC, "searchProcNet() THIS IS THE LINE:", fields)
|
||||
return fields[9]
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return ""
|
||||
}
|
||||
|
||||
// Search TCP and then UDP
|
||||
inode := searchProcNet("/proc/net/tcp")
|
||||
if inode == "" {
|
||||
inode = searchProcNet("/proc/net/udp")
|
||||
}
|
||||
log.Log(PROC, "searchProcNet() inode =", inode)
|
||||
|
||||
// Search for process with the inode
|
||||
procs, _ := ioutil.ReadDir("/proc")
|
||||
for _, proc := range procs {
|
||||
if !proc.IsDir() {
|
||||
continue
|
||||
}
|
||||
|
||||
fdPath := filepath.Join("/proc", proc.Name(), "fd")
|
||||
fds, err := ioutil.ReadDir(fdPath)
|
||||
if err != nil {
|
||||
continue // Process might have exited; skip it
|
||||
}
|
||||
|
||||
for _, fd := range fds {
|
||||
fdLink, _ := os.Readlink(filepath.Join(fdPath, fd.Name()))
|
||||
var s string
|
||||
s = "socket:[" + inode + "]"
|
||||
if strings.Contains(fdLink, "socket:[") {
|
||||
log.Log(PROC, "searchProcNet() fdLink has socket:", fdLink)
|
||||
log.Log(PROC, "searchProcNet() proc.Name() =", proc.Name(), "s =", s)
|
||||
}
|
||||
if strings.Contains(fdLink, "socket:[35452]") {
|
||||
log.Log(PROC, "searchProcNet() found proc.Name() =", proc.Name(), fdLink)
|
||||
return proc.Name()
|
||||
}
|
||||
if strings.Contains(fdLink, "socket:[35450]") {
|
||||
log.Log(PROC, "searchProcNet() found proc.Name() =", proc.Name(), fdLink)
|
||||
return proc.Name()
|
||||
}
|
||||
if strings.Contains(fdLink, "socket:[35440]") {
|
||||
log.Log(PROC, "searchProcNet() found proc.Name() =", proc.Name(), fdLink)
|
||||
return proc.Name()
|
||||
}
|
||||
if strings.Contains(fdLink, "socket:[21303]") {
|
||||
log.Log(PROC, "searchProcNet() found proc.Name() =", proc.Name(), fdLink)
|
||||
// return proc.Name()
|
||||
}
|
||||
if strings.Contains(fdLink, "socket:["+inode+"]") {
|
||||
return proc.Name()
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return ""
|
||||
}
|
||||
|
|
@ -0,0 +1,24 @@
|
|||
package main
|
||||
|
||||
import (
|
||||
"github.com/jsimonetti/rtnetlink"
|
||||
)
|
||||
|
||||
// List all interfaces
|
||||
func Example_listLink() {
|
||||
// Dial a connection to the rtnetlink socket
|
||||
conn, err := rtnetlink.Dial(nil)
|
||||
if err != nil {
|
||||
exit(err)
|
||||
}
|
||||
defer conn.Close()
|
||||
|
||||
// Request a list of interfaces
|
||||
msg, err := conn.Link.List()
|
||||
if err != nil {
|
||||
log(err)
|
||||
}
|
||||
|
||||
log("%#v", msg)
|
||||
log(SPEW, msg)
|
||||
}
|
||||
61
structs.go
61
structs.go
|
|
@ -1,61 +0,0 @@
|
|||
/*
|
||||
figures out if your hostname is valid
|
||||
then checks if your DNS is setup correctly
|
||||
*/
|
||||
|
||||
package linuxstatus
|
||||
|
||||
import (
|
||||
"net"
|
||||
|
||||
"go.wit.com/gui"
|
||||
"go.wit.com/lib/gadgets"
|
||||
)
|
||||
|
||||
var me *LinuxStatus
|
||||
|
||||
type LinuxStatus struct {
|
||||
ready bool
|
||||
hidden bool
|
||||
changed bool
|
||||
|
||||
parent *gui.Node
|
||||
|
||||
ifmap map[int]*IFtype // the current interfaces
|
||||
ipmap map[string]*IPtype // the current ip addresses
|
||||
|
||||
window *gadgets.BasicWindow
|
||||
group *gui.Node
|
||||
grid *gui.Node
|
||||
|
||||
hostnameStatus *gadgets.OneLiner
|
||||
hostname *gadgets.OneLiner
|
||||
hostshort *gadgets.OneLiner
|
||||
domainname *gadgets.OneLiner
|
||||
resolver *gadgets.OneLiner
|
||||
uid *gadgets.OneLiner
|
||||
IPv4 *gadgets.OneLiner
|
||||
IPv6 *gadgets.OneLiner
|
||||
workingIPv4 *gadgets.OneLiner
|
||||
workingIPv6 *gadgets.OneLiner
|
||||
Interfaces *gui.Node
|
||||
speed *gadgets.OneLiner
|
||||
speedActual *gadgets.OneLiner
|
||||
}
|
||||
|
||||
type IPtype struct {
|
||||
gone bool // used to track if the ip exists
|
||||
ipv6 bool // the future
|
||||
ipv4 bool // the past
|
||||
LinkLocal bool
|
||||
iface *net.Interface
|
||||
ip net.IP
|
||||
ipnet *net.IPNet
|
||||
}
|
||||
|
||||
type IFtype struct {
|
||||
gone bool // used to track if the interface exists
|
||||
name string // just a shortcut to the name. maybe this is dumb
|
||||
// up bool // could be used to track ifup/ifdown
|
||||
iface *net.Interface
|
||||
}
|
||||
38
timer.go
38
timer.go
|
|
@ -1,38 +0,0 @@
|
|||
package linuxstatus
|
||||
|
||||
import (
|
||||
"sort"
|
||||
"strings"
|
||||
"time"
|
||||
)
|
||||
|
||||
// timeFunction takes a function as an argument and returns the execution time.
|
||||
func timeFunction(f func()) time.Duration {
|
||||
startTime := time.Now() // Record the start time
|
||||
f() // Execute the function
|
||||
return time.Since(startTime) // Calculate the elapsed time
|
||||
}
|
||||
|
||||
// sortLines takes a string, splits it on newlines, sorts the lines,
|
||||
// and rejoins them with newlines.
|
||||
func sortLines(input string) string {
|
||||
lines := strings.Split(input, "\n")
|
||||
|
||||
// Trim leading and trailing whitespace from each line
|
||||
for i, line := range lines {
|
||||
lines[i] = strings.TrimSpace(line)
|
||||
}
|
||||
|
||||
sort.Strings(lines)
|
||||
tmp := strings.Join(lines, "\n")
|
||||
tmp = strings.TrimLeft(tmp, "\n")
|
||||
tmp = strings.TrimRight(tmp, "\n")
|
||||
return tmp
|
||||
}
|
||||
|
||||
func (ls *LinuxStatus) SetSpeedActual(s string) {
|
||||
if !ls.Ready() {
|
||||
return
|
||||
}
|
||||
ls.speedActual.SetText(s)
|
||||
}
|
||||
69
unix.go
69
unix.go
|
|
@ -2,17 +2,14 @@
|
|||
|
||||
// https://wiki.archlinux.org/title/Dynamic_DNS
|
||||
|
||||
package linuxstatus
|
||||
package main
|
||||
|
||||
import (
|
||||
"bytes"
|
||||
"fmt"
|
||||
"net"
|
||||
import (
|
||||
"os"
|
||||
"os/exec"
|
||||
"strings"
|
||||
|
||||
"go.wit.com/log"
|
||||
"net"
|
||||
// "git.wit.org/wit/gui"
|
||||
// "github.com/davecgh/go-spew/spew"
|
||||
)
|
||||
|
||||
func CheckSuperuser() bool {
|
||||
|
|
@ -27,71 +24,43 @@ func Escalate() {
|
|||
cmd.Stderr = os.Stderr
|
||||
err := cmd.Run()
|
||||
if err != nil {
|
||||
log.Error(err, "exit in Escalate()")
|
||||
log.Exit(err)
|
||||
exit(err)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// You need permission to do a zone transfer. Otherwise:
|
||||
// dig +noall +answer +multiline lab.wit.com any
|
||||
// dig +all +multiline fire.lab.wit.com # gives the zonefile header (ttl vals)
|
||||
// dig +noall +answer +multiline lab.wit.org any
|
||||
// dig +all +multiline fire.lab.wit.org # gives the zonefile header (ttl vals)
|
||||
func DumpPublicDNSZone(zone string) {
|
||||
entries, err := net.LookupHost(zone)
|
||||
if err != nil {
|
||||
panic(err)
|
||||
}
|
||||
for _, entry := range entries {
|
||||
log.Println(entry)
|
||||
log(entry)
|
||||
}
|
||||
}
|
||||
|
||||
func dumpIPs(host string) {
|
||||
ips, err := net.LookupIP(host)
|
||||
if err != nil {
|
||||
log.Error(err, "dumpIPs() failed")
|
||||
}
|
||||
for _, ip := range ips {
|
||||
log.Println(host, ip)
|
||||
}
|
||||
ips, err := net.LookupIP(host)
|
||||
if err != nil {
|
||||
exit(err)
|
||||
}
|
||||
for _, ip := range ips {
|
||||
log(host, ip)
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
check if ddclient is installed, working, and/or configured
|
||||
https://github.com/ddclient/ddclient
|
||||
check if ddclient is installed, working, and/or configured
|
||||
https://github.com/ddclient/ddclient
|
||||
*/
|
||||
func ddclient() {
|
||||
}
|
||||
|
||||
/*
|
||||
check if ddupdate is installed, working, and/or configured
|
||||
check if ddupdate is installed, working, and/or configured
|
||||
*/
|
||||
func ddupdate() {
|
||||
}
|
||||
|
||||
func run(s string) string {
|
||||
cmdArgs := strings.Fields(s)
|
||||
// Define the command you want to run
|
||||
// cmd := exec.Command(cmdArgs)
|
||||
cmd := exec.Command(cmdArgs[0], cmdArgs[1:len(cmdArgs)]...)
|
||||
|
||||
// Create a buffer to capture the output
|
||||
var out bytes.Buffer
|
||||
|
||||
// Set the output of the command to the buffer
|
||||
cmd.Stdout = &out
|
||||
|
||||
// Run the command
|
||||
err := cmd.Run()
|
||||
if err != nil {
|
||||
fmt.Println("Error running command:", err)
|
||||
return ""
|
||||
}
|
||||
|
||||
// Trim leading and trailing whitespace from each line
|
||||
tmp := strings.TrimSpace(out.String())
|
||||
// Output the results
|
||||
log.Verbose("Command Output:", tmp)
|
||||
|
||||
return tmp
|
||||
}
|
||||
|
|
|
|||
43
update.go
43
update.go
|
|
@ -1,43 +0,0 @@
|
|||
package linuxstatus
|
||||
|
||||
import (
|
||||
"errors"
|
||||
"fmt"
|
||||
"time"
|
||||
|
||||
"go.wit.com/log"
|
||||
)
|
||||
|
||||
func (ls *LinuxStatus) Update() {
|
||||
if ls == nil {
|
||||
return
|
||||
}
|
||||
if !ls.Ready() {
|
||||
log.Log(WARN, "can't update yet. ready is false")
|
||||
log.Error(errors.New("Update() is not ready yet"))
|
||||
return
|
||||
}
|
||||
log.Log(INFO, "Update() START")
|
||||
duration := timeFunction(func() {
|
||||
linuxLoop()
|
||||
})
|
||||
ls.setSpeed(duration)
|
||||
log.Log(INFO, "Update() END")
|
||||
}
|
||||
|
||||
func (ls *LinuxStatus) setSpeed(duration time.Duration) {
|
||||
s := fmt.Sprint(duration)
|
||||
if ls.speedActual == nil {
|
||||
log.Log(WARN, "can't actually warn")
|
||||
return
|
||||
}
|
||||
ls.speedActual.SetText(s)
|
||||
|
||||
if duration > 500*time.Millisecond {
|
||||
ls.speed.SetText("SLOW")
|
||||
} else if duration > 100*time.Millisecond {
|
||||
ls.speed.SetText("OK")
|
||||
} else {
|
||||
ls.speed.SetText("FAST")
|
||||
}
|
||||
}
|
||||
Loading…
Reference in New Issue